Affiliations: [a] Nagoya Institute of Technology, Gokiso-cho Showa-ku Nagoya 466-8555, Japan. [email protected] | [b] Florida Institute of Technology, Melbourne FL 32901, United States of America. [email protected] | [c] Kobe University, 5-1-1 Fukaeminami-machi Higashinada-ku Kobe, 658-0022, Japan. [email protected] | [d] Kobe University, 5-1-1 Fukaeminami-machi Higashinada-ku Kobe, 658-0022, Japan. [email protected] | [e] Kyushu University, 744 Motooka Nishi-ku Fukuoka 819-0395, Japan. [email protected] | [f] Nagoya Institute of Technology, Gokiso-cho Showa-ku Nagoya 466-8555, Japan. [email protected]
Correspondence:
[*]
Address for correspondence: Nagoya Institute of Technology, Gokiso-cho Showa-ku Nagoya 466-8555, Japan
Abstract: 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.
