Embedding preference ordering for symmetric DCOP solvers on spanning trees

Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Max-Sum algorithm is a solution method for the Distributed Constraint Optimization Problem (DCOP) which is a fundamental problem in multiagent cooperation. Particularly, we focus on the case of Max-Sum on a spanning tree, where the algorithm is an exact solution method. In this case, all agents simultaneously compute globally optimal objective values as erootf nodes of the tree that represents the problem. On the other hand, a tiebreak is generally necessary in order to determine a unique optimal solution among the agents. While top-down post-processing is a well-known solution, one can prefer to design the solver as a bottom-up computation that is simply integrated to pre-processing. To address this issue, we investigate a technique that employs a preference ordering based on spanning trees for the optimization algorithms. With this technique, top-down processing to choose a unique optimal solution can be embedded into bottom-up optimization via small weight values for the preference ordering. We also evaluate an integrated algorithm that maintains both tree structures and quasi-optimal solutions using the bottom-up approaches.

Original languageEnglish
Title of host publicationPRIMA 2013
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 16th International Conference, Proceedings
Pages197-212
Number of pages16
DOIs
Publication statusPublished - Dec 1 2013
Event16th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2013 - Dunedin, New Zealand
Duration: Dec 1 2013Dec 6 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8291 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2013
CountryNew Zealand
CityDunedin
Period12/1/1312/6/13

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., & Matsuo, H. (2013). Embedding preference ordering for symmetric DCOP solvers on spanning trees. In PRIMA 2013: Principles and Practice of Multi-Agent Systems - 16th International Conference, Proceedings (pp. 197-212). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8291 LNAI). https://doi.org/10.1007/978-3-642-44927-7_14