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

Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

Research output: Contribution to conferencePaper

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

Fingerprint

Trees (mathematics)

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Okimoto, T., Joe, Y., Iwasaki, A., & Yokoo, M. (2011). Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds. 1199-1200. Paper presented at 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011, Taipei, Taiwan, Province of China.

Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds. / Okimoto, Tenda; Joe, Yongjoon; Iwasaki, Atsushi; Yokoo, Makoto.

2011. 1199-1200 Paper presented at 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011, Taipei, Taiwan, Province of China.

Research output: Contribution to conferencePaper

Okimoto, T, Joe, Y, Iwasaki, A & Yokoo, M 2011, 'Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds', Paper presented at 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011, Taipei, Taiwan, Province of China, 5/2/11 - 5/6/11 pp. 1199-1200.
Okimoto T, Joe Y, Iwasaki A, Yokoo M. Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds. 2011. Paper presented at 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011, Taipei, Taiwan, Province of China.
Okimoto, Tenda ; Joe, Yongjoon ; Iwasaki, Atsushi ; Yokoo, Makoto. / Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds. Paper presented at 10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011, Taipei, Taiwan, Province of China.2 p.
@conference{0b7c6392b33145759b96405a0fb4bfc8,
title = "Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds",
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.",
author = "Tenda Okimoto and Yongjoon Joe and Atsushi Iwasaki and Makoto Yokoo",
year = "2011",
month = "1",
day = "1",
language = "English",
pages = "1199--1200",
note = "10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 ; Conference date: 02-05-2011 Through 06-05-2011",

}

TY - CONF

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

AU - Okimoto, Tenda

AU - Joe, Yongjoon

AU - Iwasaki, Atsushi

AU - Yokoo, Makoto

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84899458759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899458759&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84899458759

SP - 1199

EP - 1200

ER -