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

Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

研究成果: 会議への寄与タイプ論文

抜粋

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.

元の言語英語
ページ1199-1200
ページ数2
出版物ステータス出版済み - 1 1 2011
イベント10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 - Taipei, 台湾省、中華民国
継続期間: 5 2 20115 6 2011

その他

その他10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011
台湾省、中華民国
Taipei
期間5/2/115/6/11

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

これを引用

Okimoto, T., Joe, Y., Iwasaki, A., & Yokoo, M. (2011). Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds. 1199-1200. 論文発表場所 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011, Taipei, 台湾省、中華民国.