Advertisement

Leximin Asymmetric Multiple Objective DCOP on Factor Graph

  • Toshihiro Matsui
  • Marius Silaghi
  • Tenda Okimoto
  • Katsutoshi Hirayama
  • Makoto Yokoo
  • Hiroshi Matsuo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9387)

Abstract

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.

Keywords

Distributed constraint optimization Asymmetric Multiple objectives Leximin Egalitarian 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fave, D., Maria, F., Stranders, R., Rogers, A., Jennings, N.R.: Bounded decentralised coordination over multiple objectives. In: 10th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 371–378 (2011)Google Scholar
  2. 2.
    Farinelli, A., Rogers, A., Petcu, A., Jennings, N.R.: Decentralised coordination of low-power embedded devices using the max-sum algorithm. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 639–646 (2008)Google Scholar
  3. 3.
    Grinshpoun, T., Grubshtein, A., Zivan, R., Netzer, A., Meisels, A.: Asymmetric distributed constraint optimization problems. J. Artif. Intell. Res. 47, 613–647 (2013)MathSciNetMATHGoogle Scholar
  4. 4.
    Marler, R.T., Arora, J.S.: Survey of multi-objective optimization methods for engineering. Structural and Multidisciplinary Optimization 26, 369–395 (2004)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Matsui, T., Matsuo, H.: Considering equality on distributed constraint optimization problem for resource supply network. In: 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology, vol. 2, pp. 25–32 (2012)Google Scholar
  6. 6.
    Matsui, T., Matsuo, H.: Complete distributed search algorithm for cyclic factor graphs. In: 6th International Conference on Agents and Artificial Intelligence, pp. 184–192 (2014)Google Scholar
  7. 7.
    Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., Matsuo, H.: Distributed search method with bounded cost vectors on multiple objective dcops. In: Principles and Practice of Multi-Agent Systems - 15th International Conference, pp. 137–152 (2012)Google Scholar
  8. 8.
    Modi, P.J., Shen, W., Tambe, M., Yokoo, M.: Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1–2), 149–180 (2005)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Netzer, A., Meisels, A.: SOCIAL DCOP - social choice in distributed constraints optimization. In: 5th International Symposium on Intelligent Distributed Computing, pp. 35–47 (2011)Google Scholar
  10. 10.
    Netzer, A., Meisels, A.: Distributed envy minimization for resource allocation. In: 5th International Conference on Agents and Artificial Intelligence, vol. 1, pp. 15–24 (2013)Google Scholar
  11. 11.
    Netzer, A., Meisels, A.: Distributed local search for minimizing envy. In: 2013 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, pp. 53–58 (2013)Google Scholar
  12. 12.
    Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: 19th International Joint Conference on Artificial Intelligence, pp. 266–271 (2005)Google Scholar
  13. 13.
    Rogers, A., Farinelli, A., Stranders, R., Jennings, N.R.: Bounded approximate decentralised coordination via the Max-Sum algorithm. Artif. Intell. 175(2), 730–759 (2011)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Sen, A.K.: Choice, Welfare and Measurement. Harvard University Press, Cambridge (1997)MATHGoogle Scholar
  15. 15.
    Matsui, T., Silaghi, M., Katsutoshi, H., Makoto, Y., Matsuo, H.: Leximin multiple objective optimization for preferences of agents. In: 17th International Conference on Principles and Practice of Multi-Agent SystemsGoogle Scholar
  16. 16.
    Zivan, R.: Anytime local search for distributed constraint optimization. In: Twenty-Third AAAI Conference on Artificial Intelligence, pp. 393–398 (2008)Google Scholar
  17. 17.
    Zivan, R., Peled, H.: Max/min-sum distributed constraint optimization through value propagation on an alternating dag. In: 11th International Conference on Autonomous Agents and Multiagent Systems, pp. 265–272 (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Toshihiro Matsui
    • 1
  • Marius Silaghi
    • 2
  • Tenda Okimoto
    • 3
  • Katsutoshi Hirayama
    • 3
  • Makoto Yokoo
    • 4
  • Hiroshi Matsuo
    • 1
  1. 1.Nagoya Institute of TechnologyNagoyaJapan
  2. 2.Florida Institute of TechnologyMelbourneUSA
  3. 3.Kobe UniversityKobeJapan
  4. 4.Kyushu UniversityFukuokaJapan

Personalised recommendations