Privacy loss in distributed constraint reasoning: A quantitative framework for analysis and its applications

Autonomous Agents and Multi-Agent Systems

Volumn 13, Issue 1, 2006, Pages 27-60

  Maheswaran, Rajiv T ^a   Pearce, Jonathan P ^a   Bowring, Emma ^a   Varakantham, Pradeep ^a   Tambe, Milind ^a  

^a University of Southern California ^*  (United States)

Author keywords

Distributed constraint optimization; Distributed constraint reasoning; Privacy

Indexed keywords

EID: 33646000597     PISSN: 13872532     EISSN: 15737454     Source Type: Journal    
DOI: 10.1007/s10458-006-5951-y     Document Type: Review

References (31)

1. Berry, P. M., Gervasio, M., Uribe, T. E., Myers, K., & Nitz, K. (2005). A personalized calendar assistant. In AAAI spring symposium on persistent assistants: Living and working with AI.
2. Bowring, E., Tambe, M., & Yokoo, M. (2005). Optimize my schedule but keep it flexible: Distributed multi-criteria coordination for personal assistants. In AAAI spring symposium on persistent assistants: Living and working with AI.
3. Brandt, F. (2001). Cryptographic protocols for secure second-price Auctions. In: Cooperative information agents V, lecture notes in artificial intelligence (LNAI). (Vol. 2182) (pp. 154-165).
4. Brandt, F. (2003). Fully private auctions in a constant number of rounds. In Proceedings of the 7th annual conference on financial cryptography (FC), (pp. 223-238).
5. Chalupsky, H., Gil, Y., Knoblock, C., Lerman, K., Oh, J., Pynadath, D., Russ, T., & Tambe, M. (2001). Electric elves: Applying agent technology to support human organizations. In International conference on innovative applications of artificial intelligence, (pp. 51-58).
6. Ephrati, E., Zlotkin, G., & Rosenschein, J. S. (1994). A non-manipulable meeting scheduling system. In Proceedings of the 13th international workshop on distributed artificial intelligence. Seattle, WA.
7. Franzin, M. S., Freuder, E. C., Rossi, F., & Wallace, R. (2002). Multi-agent meeting scheduling with preferences: Efficiency, privacy loss, and solution quality. In Proceedings of the AAAI workshop on preference in AI and CP. Edmonton, Canada.
8. Franzin, M. S., Freuder, E. C., Rossi, F., & Wallace, R. (2004). Multi-agent constraint systems with preferences: Efficiency solution quality and privacy loss. Computational intelligence, 20(2), 264-286.
9. Garrido, L., & Sycara, K. (1996). Multi-agent meeting scheduling: Preliminary results. In Proceedings of the 1996 international conference on multi-agent systems (ICMAS '96), (pp. 95-102).
10. Hassine, A. B., Défago, X., & Ho, T. (2004). Agent-based approach to dynamic meeting scheduling problems. In Proceedings of the third international joint conference on autonomous agents and multi agent systems (AAMAS 2004), (pp. 1132-1139) New York, NY.
11. Hirayama, K., & Yokoo, M. (1997) Distributed partial constraint satisfaction problem. In G. Smolka (ed.), Principles and practice of constraint programming, (pp. 222-236).
12. Liu, J., & Sycara, K. P. (1996) Multiagent coordination in tightly coupled task scheduling. In Proceedings of the second international conference on multiagent systems, (pp. 181-187).
13. Maheswaran, R. T., Bowring, E., Pearce, J. P., Varakantham, P., & Tambe, M. (2004). Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In Proceedings of the third international joint conference on autonomous agents and multi agent systems (AAMAS 2004), (pp. 310-317) New York.
14. Maheswaran, R. T., Pearce, J. P., Varakantham, P., Bowring, E., & Tambe, M. (2005). Valuations of possible states (VPS): A unifying quantitative framework for analysis of privacy loss in collaboration. In Proceedings of the fourth international joint conference on autonomous agents and multi agent systems (AAMAS 2005), (pp. 1030-1037) Utrecht, The Netherlands.
15. Mailler, R., & Lesser, V. (2004) Solving distributed constraint optimization problems using cooperative mediation. In Proceedings of Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), (pp. 438-445) New York, NY.
16. Meisels, A., & Lavee, O. (2004). Using additional information in DisCSPs search. In Proceedings of the 5th workshop on distributed constraints reasoning (DCR-04). Toronto, CA.
17. Modi, P. J., Shen, W., Tambe, M., & Yokoo, M. (2003). An asynchronous complete method for distributed constraint optimization. In Proceedings of the second international conference on autonomous agents and multi-agent systems, (pp. 161-168).
18. Modi, J. P., & Veloso, M. (2005). Bumping strategies for the multiagent agreement problem. In Proceedings of the fourth international joint conference on autonomous agents and multi agent systems (AAMAS 2005), (pp. 390-396). Utrecht, The Netherlands.
19. Naor, M., Pinkas, B., & Sumner, R. (1999). Privacy preserving auctions and mechanism design. In Proceedings of the first ACM conference on electronic commerce, (pp. 129-139).
20. Paruchuri, P., Tambe, M., Dini, D., Kraus, S., & Ordonez, F. (2005). Safety in multiagent systems via policy randomization. In AAMAS workshop on safety and security in multiagent systems.
21. Sadeh, N., & Fox, M. S. (1996). Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence, 86, 1-41.
22. Scerri, P., Pynadath, D., & Tambe, M. (2002). Towards adjustable autonomy for the real-world. Journal of Artificial Intelligence Research, 17, 171-228.
23. Sen, S. (1997). Developing an automated distributed meeting scheduler. IEEE Expert: Intelligent Systems and Their Applications, 12(4), 41-45.
24. Silaghi, M. (2004). Meeting scheduling guaranteeing n/2-privacy and resistant to statistical analysis (applicable to any DisCSP). In 3rd IC on web intelligence, (pp. 711-715).
25. Silaghi, M. C., & Faltings, B. (2002). A Comparison of distributed constraint satisfaction approaches with respect to privacy. In Proceedings of the 3rd workshop on distributed constraints reasoning (DCR-02). Bologna, Italy.
26. Silaghi, M. C., & Mitra, D. (2004). Distributed constraint satisfaction and optimization with privacy enforcement. In Proceedings of the 2004 IEEE/WIC/ACM international conference on intelligent agent technology (IAT 2004), (pp. 531-535) Beijing, China.
27. Silaghi, M. C., Sam-Haroud, D., & Faltings, B. (2001). ABT with asynchronous reordering. In Second Asia-Pacific conf. on intelligent agent technology, (pp. 54-63) Maebashi, Japan.
28. van Otterloo, S. (2005). The value of privacy: optimal strategies for privacy minded agents. In Proceedings of the fourth international joint conference on autonomous agents and multi agent systems (AAMAS 2005), (pp. 1015-1022) Utrecht, The Netherlands.
29. Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1998). The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10(5), 673-685.
30. Yokoo, M., & Hirayama, K. (1996). Distributed breakout algorithm for solving distributed constraint satisfaction and optimization problems. In Proceedings of the second international conference on multiagent systems, (pp. 401-406) Kyoto, Japan.
31. Yokoo, M., Suzuki, K., & Hirayama, K. (2002). Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In Proceedings of the 8th international conference on principles and practice of constraint programming (CP 2002, LNCS 2470), (pp. 387-401) Ithaca, NY.