Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds

Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

Research output: Contribution to conferencePaperpeer-review

Abstract

Most incomplete DCOP algorithms generally do not provide any guarantees on the quality of the solutions. In this paper, we introduce a new incomplete DCOP algorithm that can provide the upper bounds of the absolute/relative errors of the solution, which can be obtained a priori/a posteriori, respectively. The evaluation results illustrate that this algorithm can obtain better quality solutions and bounds compared to existing bounded incomplete DCOP algorithms, while the run time of this algorithm is much shorter.

Original languageEnglish
Pages1199-1200
Number of pages2
Publication statusPublished - Jan 1 2011
Event10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 - Taipei, Taiwan, Province of China
Duration: May 2 2011May 6 2011

Other

Other10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011
CountryTaiwan, Province of China
CityTaipei
Period5/2/115/6/11

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds'. Together they form a unique fingerprint.

Cite this