Skip to main content

Shapley Value Based Allocation for Multi-objective Cooperative Problems

  • Conference paper
  • First Online:
Operations Research Proceedings 2017

Part of the book series: Operations Research Proceedings ((ORP))

  • 2113 Accesses

Abstract

In this paper the traveling salesman problem is used as an example to describe an allocation concept for cooperative scenarios where besides a common objective function also individual objectives of players are of importants. From a game theoretical view, such a problem corresponds to a cooperative game with non-transferable as well as transferable utilities. We define formally this cooperative game as well as an allocation concept motivated by the Shapley NTU value.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Andersen, K. A., & Lind, M. (1999). Computing the NTU-Shapley value of NTU games defined by multiple objective linear programs. International Journal of Game Theory, 28, 585–597.

    Article  Google Scholar 

  2. Christinsen, F., Lind, M., & Tind, J. (1996). On the Nucleolus of NTU-games defined by multiple objective linear programs. Mathematical Methods of Operations Research, 43, 337–352.

    Article  Google Scholar 

  3. Fernandez, F. R., Hinojosa, M. A., & Puerto, J. (2003). Multi-criteria minimum cost spanning tree games. European Journal of Operational Research, 158, 399–408.

    Article  Google Scholar 

  4. Fernandez, F. R., Hinojosa, M. A., & Puerto, J. (2004). Set-valued TU games. European Journal of Operational Research, 159, 181–195.

    Article  Google Scholar 

  5. Kimms, A., & Kozeletskyi, I. (2017). Consideration of multiple objectives in horizontal cooperation with an application to transportation planning. IEEE Transactions(to appear).

    Article  Google Scholar 

  6. Kimms, A., Kozeletskyi I., & Meca, A. (2014). Bi-allocation games: A new class of cooperative games with transferable and non-transferable utilities. Working Paper.

    Google Scholar 

  7. Kozeletskyi, I. (2016). Game-theoretic approaches to allocation Problems in cooperative routing. Books on Demand.

    Google Scholar 

  8. Nishizaki, I., & Sakawa, M. (2001). On computational methods for solutions of multiobjective linear production games. European Journal of Operational Research, 129, 386–413.

    Article  Google Scholar 

  9. Shapley, L. S. (1988). Utility comparison and the theory of games. In A. E. Roth (Ed.), The Shapley value: Essays in honor of Lloyd S. Shapley (pp. 307–319). Cambridge: Cambridge University Press.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Igor Kozeletskyi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kozeletskyi, I. (2018). Shapley Value Based Allocation for Multi-objective Cooperative Problems. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_3

Download citation

Publish with us

Policies and ethics