TY - JOUR
T1 - Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents
AU - Matsui, Toshihiro
AU - Silaghi, Marius
AU - Okimoto, Tenda
AU - Hirayama, Katsutoshi
AU - Yokoo, Makoto
AU - Matsuo, Hiroshi
N1 - Funding Information:
Acknowledgments: This work was supported in part by KAKENHI Grant-in-Aid for Scientific Research (C), 25330257 and 16K00301.
Publisher Copyright:
© 2018 IOS Press. All rights reserved.
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85047927092&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85047927092&partnerID=8YFLogxK
U2 - 10.3233/FI-2018-1642
DO - 10.3233/FI-2018-1642
M3 - Article
AN - SCOPUS:85047927092
SN - 0169-2968
VL - 158
SP - 63
EP - 91
JO - Fundamenta Informaticae
JF - Fundamenta Informaticae
IS - 1-3
ER -