Analysis of privacy loss in distributed constraint optimization

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 647-653

  Greenstadt, Rachel ^a   Pearce, Jonathan P ^b   Tambe, Milind ^b  

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DCOP ALGORITHMS; DISTRIBUTED CONSTRAINT OPTIMIZATION (DCOP); GRAPH TOPOLOGY; PRIVACY LOSS;

ALGORITHMS; CONSTRAINT THEORY; DECISION THEORY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; OPTIMIZATION;

MULTI AGENT SYSTEMS;

EID: 33750742251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Franzin, M. S.; F.Rossi; Freuder, E. C.; and Wallace, R. 2004. Multi-agent meeting scheduling with preferences: efficiency, privacy loss, and solution quality. Computational Intelligence 20(2).
2. Hassine, A.; Defago, X.; and Ho, T. 2004. Agent-based approach to dynamic meeting scheduling problems. In AAMAS.
3. Hirayama, K., and Yokoo, M. 1997. Distributed partial constraint satisfaction problem. In Smolka, G., ed., Principles and Practice of Constraint Programming.
4. Maheswaran, R. T.; Tambe, M.; Bowring, E.; Pearce, J. P.; and Varakantham, P. 2004. Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling. In AAMAS.
5. Maheswaran, R. T.; Pearce, J. P.; Varakantham, P.; Bowring, E.; and Tambe, M. 2005. Valuations of possible states (VPS):a quantitative framework for analysis of privacy loss among collaborative personal assistant agents. In AAMAS.
6. Maheswaran, R. T.; Pearce, J. P.; Bowring, E.; Varakantham, P.; and Tambe, M. 2006. Privacy loss in distributed constraint reasoning: A quantitative framework for analysis and its applications. Journal of Agents and Multiagent Systems (to appear).
7. Meisels, A., and Lavee, O. 2004. Using additional information in DisCSPs search. In Workshop on Distributed Constraint Reasoning.
8. Modi, P. J., and Veloso, M. 2005. Bumping strategies for the multiagent agreement problem. In AAMAS.
9. Modi, P. J.; Shen, W.; Tambe, M.; and Yokoo, M. 2005. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence Journal 161:149-180.
10. Petcu, A., and Fallings, B. 2005. A scalable method for multiagent constraint optimization. In IJCAI.
11. Silaghi, M. C., and Fallings, B. 2002. A comparison of distributed constraint satisfaction approaches with respect to privacy. In Workshop on Distributed Constraint Reasoning.
12. Silaghi, M. 2004. Meeting scheduling guaranteeing n/2-privacy and resistant to statistical analysis (applicable to any discsp). In 3rd 1C on Web Intelligence.
13. Wallace, R., and Freuder, E. 2005. Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving. AIJ 161(1-2):209-227.
14. Yokoo, M.; Suzuki, K.; and Hirayama, K. 2002. Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In CP 2002.