WHEN YOU SAY (DCOP) PRIVACY, WHAT DO YOU MEAN? - Categorization of DCOP Privacy and Insights on Internal Constraint Privacy

Tal Grinshpoun

2012

Abstract

Privacy preservation is a main motivation for using the DCOP model and as such, it has been the subject of comprehensive research. The present paper provides for the first time a categorization of all possible DCOP privacy types. The paper focuses on a specific type, internal constraint privacy, which is highly relevant for models that enable asymmetric payoffs (PEAV-DCOP and ADCOP). An analysis of the run of two algorithms, one for ADCOP and one for PEAV, reveals that both models lose some internal constraint privacy.

References

  1. Brito, I., Meisels, A., Meseguer, P., and Zivan, R. (2009). Distributed constraint satisfaction with partially known constraints. Constraints, 14(2):199-234.
  2. Doshi, P., Matsui, T., Silaghi, M., Yokoo, M., and Zanker, M. (2008). Distributed private constraint optimization. In IAT, pages 277-281.
  3. Faltings, B. and Macho-Gonzalez, S. (2005). Open constraint programming. Artificial Intelligence, 161:1- 2:181-208.
  4. Franzin, M. S., Rossi, F., Freuder, E. C., and Wallace, R. J. (2004). Multi-agent constraint systems with preferences: Efficiency, solution quality, and privacy loss. Computational Intelligence, 20(2):264-286.
  5. Gershman, A., Meisels, A., and Zivan, R. (2009). Asynchronous forward bounding. JAIR, 34:25-46.
  6. Greenstadt, R. (2009). An overview of privacy improvements to k-optimal dcop algorithms. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, AAMAS 7809, pages 1279-1280, Richland, SC. International Foundation for Autonomous Agents and Multiagent Systems.
  7. Greenstadt, R., Grosz, B., and Smith, M. D. (2007). Ssdpop: improving the privacy of dcop with secret sharing. In Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, AAMAS 7807, pages 171:1-171:3, New York, NY, USA. ACM.
  8. Greenstadt, R., Pearce, J., and Tambe, M. (2006). Analysis of privacy loss in distributed constraint optimization. In Proc. AAAI-06, pages 647-653, Boston, MA.
  9. Grinshpoun, T. and Meisels, A. (2008). Completeness and performance of the apo algorithm. J. of Artificial Intelligence Research, 33:223-258.
  10. Grubshtein, A., Grinshpoun, T., Meisels, A., and Zivan, R. (2009). Asymmetric distributed constraint optimization. In IJCAI-2009 Workshop on Distributed Constraints Reasoning (DCR-09), pages 60-74, Pasadena, CA.
  11. Grubshtein, A., Zivan, R., Grinshpoun, T., and Meisels, A. (2010). Local search for distributed asymmetric optimization. In Proc. 9th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2010), pages 1015-1022, Toronto, Canada.
  12. Hirayama, K. and Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In Proc. CP-97, pages 222-236.
  13. Léauté, T. and Faltings, B. (2011). Coordinating logistics operations with privacy guarantees. In IJCAI, pages 2482-2487.
  14. 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. Autonomous Agents and Multi-Agent Systems, 13(1):27-60.
  15. 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 Proc. AAMAS-04, pages 310-317, New York, NY.
  16. Mailler, R. and Lesser, V. R. (2004). Solving distributed constraint optimization problems using cooperative mediation. In Proc. AAMAS-04, pages 438-445.
  17. Matsui, T., Matsuo, H., Silaghi, M. C., Hirayama, K., Yokoo, M., and Baba, S. (2010). A quantified distributed constraint optimization problem. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1, AAMAS 7810, pages 1023-1030, Richland, SC. International Foundation for Autonomous Agents and Multiagent Systems.
  18. Meseguer, P. and Larrosa, J. (1995). Constraint satisfaction as global optimization. In Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1, pages 579-584, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
  19. Modi, P. J., Shen, W., Tambe, M., and Yokoo, M. (2005). ADOPT: asynchronous distributed constraints optimizationwith quality guarantees. Artificial Intelligence, 161:149-180.
  20. Petcu, A. and Faltings, B. (2005). A scalable method for multiagent constraint optimization. In Proc. IJCAI05, pages 266-271, Edinburgh, Scotland, UK.
  21. Petcu, A. and Faltings, B. (2006). ODPOP: An algorithm for open/distributed constraint optimization. In Proc. AAAI-06, pages 703-708, Boston.
  22. Silaghi, M. C. and Faltings, B. (2002). A comparison of distributed constraint satisfaction approaches with respect to privacy. In Workshop on Distributed Constraint Reasoning.
  23. Silaghi, M. C. and Mitra, D. (2004). Distributed constraint satisfaction and optimization with privacy enforcement. In Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 7804, pages 531-535, Washington, DC, USA. IEEE Computer Society.
  24. Stefanovitch, N., Farinelli, A., Rogers, A., and Jennings, N. R. (2011). Resource-aware junction trees for efficient multi-agent coordination. In The Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pages 363-370.
  25. Vinyals, M., Rodriguez-Aguilar, J. A., and Cerquides, J. (2011). Constructing a unifying theory of dynamic programming dcop algorithms via the generalized distributive law. Autonomous Agents and Multi-Agent Systems, 22:439-464.
  26. Yokoo, M. (2001). Distributed constraint satisfaction: foundations of cooperation in multi-agent systems. Springer-Verlag, London, UK.
  27. Zhang, W., Xing, Z., Wang, G., and Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: properties, comparishon and applications to constraints optimization problems in sensor networks. Artificial Intelligence, 161:1-2:55-88.
Download


Paper Citation


in Harvard Style

Grinshpoun T. (2012). WHEN YOU SAY (DCOP) PRIVACY, WHAT DO YOU MEAN? - Categorization of DCOP Privacy and Insights on Internal Constraint Privacy . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 380-386. DOI: 10.5220/0003752203800386


in Bibtex Style

@conference{icaart12,
author={Tal Grinshpoun},
title={WHEN YOU SAY (DCOP) PRIVACY, WHAT DO YOU MEAN? - Categorization of DCOP Privacy and Insights on Internal Constraint Privacy},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={380-386},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003752203800386},
isbn={978-989-8425-95-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - WHEN YOU SAY (DCOP) PRIVACY, WHAT DO YOU MEAN? - Categorization of DCOP Privacy and Insights on Internal Constraint Privacy
SN - 978-989-8425-95-9
AU - Grinshpoun T.
PY - 2012
SP - 380
EP - 386
DO - 10.5220/0003752203800386