Asynchronous algorithms for approximate distributed constraint optimization with quality bounds

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 1, Issue , 2010, Pages 133-140

  Kiekintveld, Christopher ^a   Yin, Zhengyu ^a   Kumar, Atul ^a   Tambe, Milind ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Approximate; Asynchronous algorithms; Bounds; DALO; DCOP; Distributed constraint optimization; Experimentation; Incomplete; T Distance Optimality; Optimality

Indexed keywords

AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS; OPTIMAL SYSTEMS; OPTIMIZATION;

APPROXIMATE; ASYNCHRONOUS ALGORITHMS; BOUNDS; DALO; DCOP; DISTRIBUTED CONSTRAINT OPTIMIZATIONS; EXPERIMENTATION; INCOMPLETE; OPTIMALITY;

ALGORITHMS;

EID: 79960831429     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439), 1999.
2. B. Bollobas. Random Graphs. Cambridge University Press. 2nd edition, 2001.
3. E. Bowring, J. P. Pearce, C. Portway, M. Jain, and M. Tambe. On k-optimal distributed constraint optimization algorithms: New bounds and algorithms. In AAMAS, 2008.
4. J. Davin and P. J. Modi. Impact of problem centralization in distributed constraint optimization algorithms. In AAMAS, 2005.
5. B. Faltings, D. Parkes. A. Petcu, and J. Shneidman. Optimizing streaming applications with self-interested users using M-DPOP. In COMSOC, 2006.
6. A. Farinelli, A. Rogers, and N. Jennings. Bounded approximate decentralised coordination using the max-sum algorithm. In DCR, 2009.
7. S. Fitzpatrick and L. Meertens. Distributed coordination through anarchic optimization. In V. Lesser, C.L. Ortiz, and M. Tambe, editors, Distributed Sensor Networks: A Multiagent Perspective. Kluwer, 2003.
8. A. Gershman, A. Meisels, and R. Zivan. Asynchronous forward-bounding for distributed constraints optimization. In First International Workshop on Distributed and Speculative Constraint Processing, 2006.
9. R. Greenstadt. An analysis of privacy loss in k-optimal algorithms. In DCR, 2008.
10. H. Katagishi and J. P. Pearce. KOPT: Distributed DCOP algorithm for arbitrary k-optima with monotonically increasing utility. In Ninth DCR Workshop (CP-07), 2007.
11. R. Mailler and V. Lesser. Using cooperative mediation to solve distributed constraint satisfaction problems. In AAMAS, 2004.
12. P. J. Modi, W.-M. Shen, M. Tambe, and M. Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence. 161(1-2), 2005.
13. J. P. Pearce, M. Tambe, and R. T. Maheswaran. Solving multiagent networks using distributed constraint optimization. AI Magazine, 29(3), 2008.
14. A. Petcu and B. Faltings. DPOP: A scalable method for multiagent constraint optimization. In IJCAI, 2005.
15. W. Schreiner. A Java toolkit for teaching distributed algorithms. In ITCSE, 2002.
16. M. C. Silaghi, R. N. Lass, E. A. Sultanik, W. C. Regli, T. Matsui, and M. Yokoo. The operation point units of distributed constraint solvers. In DCR, 2008.
17. W. Zhang, G. Wang, Z. Xing, and L. Wittcnburg. Distributed stochastic search and distributed breakout: Properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence, 161(1-2), 2005.
18. R. Zivan. Anytime local search for distributed constraint optimization. In AAMAS, 2008.