Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents

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

研究成果: ジャーナルへの寄稿学術誌査読

4 被引用数 (Scopus)


Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functions are distributed among agents. Leximin AMODCOP has been proposed as a class of Multiple Objective DCOPs, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs based on its the criteria of fairness among agents. Previous studies explore only Leximin AMODCOPs on constraint graphs limited to functions with unary or binary scopes. We address the Leximin AMODCOPs on factor graphs that directly represent n-Ary functions. A dynamic programming method on factor graphs is investigated as an exact solution method. In addition, for relatively dense problems, we also investigate several approximate/inexact algorithms.

ジャーナルFundamenta Informaticae
出版ステータス出版済み - 2018

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 代数と数論
  • 情報システム
  • 計算理論と計算数学


「Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。