・名古屋工業大学学術機関リポジトリは、名古屋工業大学内で生産された学術情報を電子的に収集・保存・発信するシステムです。 ・論文の著作権は、著者または出版社が保持しています。著作権法で定める権利制限規定を超える利用については、著作権者に許諾を得てください。 ・著者版フラグに「author」と記載された論文は、著者原稿となります。実際の出版社版とは、レイアウト、字句校正レベルの異同がある場合もあります。 ・Nagoya Institute of Technology Repository Sytem is built to collect, archive and offer electronically the academic information produced by Nagoya Institute of Technology. ・The copyright and related rights of the article are held by authors or publishers. The copyright owners' consents must be required to use it over the curtailment of copyrights. ・Textversion "Author " means the article is author's version. Author version may have some difference in layouts and wordings form publisher version.
Proc. 9th Int'l. Conf. on Autonomous Agents and Multiagent Systems (AAMAS2010)
巻
1
ページ
1023 - 1030
発行年
2010-05
出版者
The International Foundation for Autonomous Agents and Multiagent Systems (IDFAAMS)
著者版フラグ
author
内容記述
In this paper, we propose a Quantifie Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOPs have been studied as a fundamental model of multi-agent cooperation. In traditional DCOPs, all agents cooperate to optimize the sum of their cost functions. However, in practical systems some agents may desire to select the value of their variables without cooperation. In special cases, such agents may take the values with the worst impact on the quality of the result reachable by the optimization process. We apply existential/universal quantifier to distinct uncooperative variables. A universally quantifie variable is left unassigned by the optimization as the result has to hold when it takes any value from its domain, while an existentially quantifie variable takes exactly one of its values for each context. Similar classes of problems have recently been studied as (Distributed) Quantifie Constraint Problems, where the variables of the CSP have quantifiers All constraints should be satisfie independently of the value taken by universal variables. We propose a QDCOP that applies the concept of game tree search to DCOP. If the original problem is a minimization problem, agents that own universally quantifie variables may intend to maximize the cost value in the worst case. Other agents normally intend to optimize the minimizing problems. Therefore, only the bounds, especially the upper bounds, of the optimal value are guaranteed. The purpose of the new class of problems is to compute such bounds, as well as to compute sub-optimal solutions. For the QDCOP, we also propose several methods that are based on min-max/alpha-beta and ADOPT algorithms.
A Quantified Distributed Constraint Optimization Problem
本文_fulltext
(277.95KB)
