Quality guarantees for region optimal DCOP algorithms

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

Volumn 1, Issue , 2011, Pages 121-128

  Vinyals, Meritxell ^a   Shieh, Eric ^b   Cerquides, Jesus ^a   Rodriguez Aguilar, Juan Antonio ^a   Yin, Zhengyu ^b   Tambe, Milind ^b   Bowring, Emma ^c  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c UNIVERSITY OF THE PACIFIC   (United States)

Author keywords

Approximate algorithm; Bound; DCOP; Region optimality

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS;

APPROXIMATE ALGORITHMS; BOUND; C-OPTIMALITY; DCOP; DISTRIBUTED AI; FLEXIBLE FRAMEWORK; OPTIMALITY; SOLUTION QUALITY;

OPTIMIZATION;

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

References (14)

1. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
2. Bollobas. Random Graphs. Cambridge Press, 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 (2), pages 607-614, 2008.
4. A. Farinelli, A. Rogers, A. Petcu, and N. R. Jennings. Decentralised coordination of low-power embedded devices using the max-sum algorithm. In AAMAS (2), pages 639-646, 2008.
5. R. Junges and A. L. C. Bazzan. Evaluating the performance of DCOP algorithms in a real world, dynamic problem. In AAMAS, pages 599-606, 2008.
6. C. Kiekintveld, Z. Yin, A. Kumar, and M. Tambe. Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In AAMAS, pages 133-140, 2010.
7. R. Mailler and V. R. Lesser. Solving distributed constraint optimization problems using cooperative mediation. In AAMAS, pages 438-445, 2004.
8. P. J. Modi, W.-M. Shen, M. Tambe, and M. Yokoo. Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artif. Intell., 161(1-2):149-180, 2005.
9. J. P. Pearce and M. Tambe. Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In IJCAI, pages 1446-1451, 2007.
10. A. Petcu and B. Faltings. A scalable method for multi agent constraint optimization. In IJCAI, pages 266-271, 2005.
11. M. Vinyals, J. Cerquides, A. Farinelli, and J. A. Rodriguez-Aguilar. Worst-case bounds on the quality of max-product fixed-points. In NIPS, December 2010.
12. M. Vinyals, M. Pujol, J. Rodriguez-Aguilar, and J. Cerquides. Divide and Coordinate: solving DCOPs by agreement. In AAMAS, pages 150-156, 2010.
13. M. Vinyals, E. Shieh, J. Cerquides, J. A. Rodriguez-Aguilar, Z. Yin, M. Tambe, and E. Bowring. LP formulation of regional-optimal bounds. Technical Report TR-IIIA-2011-01, 2011. At: http://www.iiia.csic.es/files/pdfs/TR201101. pdf.
14. W. Zhang, G. Wang, Z. Xing, and L. Wittenburg. Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell., 161(1-2):55-87, 2005.