Leximin AMODCOP has been proposed as a class of Multiple Objective Distributed Constraint Optimization Problems, where multiple objectives for individual agents are optimized based on the leximin operator. This problem also relates to Asymmetric DCOPs with the criteria of fairness among agents, which is an important requirement in practical resource allocation tasks. 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 inexact algorithms.
CITATION STYLE
Matsui, T., Silaghi, M., Okimoto, T., Hirayama, K., Yokoo, M., & Matsuo, H. (2015). Leximin asymmetric multiple objective DCOP on factor graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9387, pp. 134–151). Springer Verlag. https://doi.org/10.1007/978-3-319-25524-8_9
Mendeley helps you to discover research relevant for your work.