Skip to main content

Leximin Asymmetric Multiple Objective DCOP on Factor Graph

  • Conference paper
  • First Online:
  • 1489 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. Grinshpoun, T., Grubshtein, A., Zivan, R., Netzer, A., Meisels, A.: Asymmetric distributed constraint optimization problems. J. Artif. Intell. Res. 47, 613–647 (2013)

    MathSciNet  MATH  Google Scholar 

  4. Marler, R.T., Arora, J.S.: Survey of multi-objective optimization methods for engineering. Structural and Multidisciplinary Optimization 26, 369–395 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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. 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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sen, A.K.: Choice, Welfare and Measurement. Harvard University Press, Cambridge (1997)

    MATH  Google Scholar 

  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 Systems

    Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Toshihiro Matsui .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Matsui, T., Silaghi, M., Okimoto, T., Hirayama, K., Yokoo, M., Matsuo, H. (2015). Leximin Asymmetric Multiple Objective DCOP on Factor Graph. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds) PRIMA 2015: Principles and Practice of Multi-Agent Systems. PRIMA 2015. Lecture Notes in Computer Science(), vol 9387. Springer, Cham. https://doi.org/10.1007/978-3-319-25524-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25524-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25523-1

  • Online ISBN: 978-3-319-25524-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics