Cooperative problem solving against adversary: Quantified distributed constraint satisfaction problem

Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Katsutoshi Hirayama, Marius Cǎlin Silaghi, Toshihiro Matsui

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

5 Citations (Scopus)

Abstract

In this paper, we extend the traditional formalization of distributed constraint satisfaction problems (DisCSP) to a quantified DisCSP. A quantified DisCSP includes several universally quantified variables, while all of the variables in a traditional DisCSP are existentially quantified. A universally quantified variable represents a choice of nature or an adversary. A quantified DisCSP formalizes a situation where a team of agents is trying to make a robust plan against nature or an adversary. In this paper, we present the formalization of such a quantified DisCSP and develop an algorithm for solving it by generalizing the asynchronous backtracking algorithm used for solving a DisCSP. In this algorithm, agents communicate a value assignment called a good in addition to the nogood used in asynchronous backtracking. Interestingly, the procedures executed by an adversarial/cooperative agent for good/nogood are completely symmetrical. Furthermore, we develop a method that improves this basic algorithm. Experimental evaluation results illustrate that we observe an easy-hard-easy transition by changing the tightness of the constraints, while very loose problem instances are relatively hard. The modification of the basic algorithm is also effective and reduces the cycles about 25% for the hardest problem instances.

Original languageEnglish
Title of host publication9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages781-788
Number of pages8
ISBN (Print)9781617387715
Publication statusPublished - Jan 1 2010
Event9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010 - Toronto, ON, Canada
Duration: May 10 2010 → …

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume2
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Other

Other9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010
CountryCanada
CityToronto, ON
Period5/10/10 → …

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Baba, S., Iwasaki, A., Yokoo, M., Hirayama, K., Silaghi, M. C., & Matsui, T. (2010). Cooperative problem solving against adversary: Quantified distributed constraint satisfaction problem. In 9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010 (pp. 781-788). (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; Vol. 2). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).