Skip to main content
Log in

Maximizing selections from the core of a cooperative game

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A core selection is a function which for each cooperative game with non-empty core selects a subset, possibly a single element, of the core. In this paper, we study selections which maximize some function or binary relation on the core. We present an axiomatic characterization of such core selections, as well as a local characterization using duality which can be applied to investigate properties of core selections. We give an application of the local characterization to a question of coalitional monotonicity of core selections.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondareva O.N.: Some applications of linear programming to the theory of cooperative games. Probl. Kibernetiki 10, 119–139 (1963)

    Google Scholar 

  2. Chinchuluun, A., Pardalos, P.M., Migdalas, A., Pitsoulis, L. (eds): Pareto Optimality, Game Theory and Equilibria. Springer, Berlin (2008)

    Google Scholar 

  3. Davis M., Maschler M.: The kernel of a cooperative game. Nav. Res. Logistics Q. 12, 223–259 (1965)

    Article  Google Scholar 

  4. Grundel, D., Murphey, R., Pardalos, P.M., Prokopyev, O. (eds): Cooperative Systems Control and Optimization, Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (2007)

    Google Scholar 

  5. Hirsch, M.J., Commander, C., Pardalos, P.M., Murphey, R. (eds.): Optimization and Cooperative Control Strategies, Proceedings of the 8th International Conference on Cooperative Control and Optimization, Lecture Notes in Control and Information Sciences, Vol. 381. Springer, Berlin (2009)

  6. Hokari T.: The nucleolus is not aggregate-monotonic on the domain of convex games. Int. J. Game Theory 29, 133–137 (2000)

    Article  Google Scholar 

  7. Hokari T.: Population monotonic solutions on convex games. Int. J. Game Theory 29, 327–338 (2000)

    Article  Google Scholar 

  8. Housman D., Clark L.: Core and monotonic allocation methods. Int. J. Game Theory 27, 611–616 (1998)

    Article  Google Scholar 

  9. Peleg B., Südhölter P.: Introduction to the theory of cooperative games, 2nd edn. Springer, Berlin (2007)

    Google Scholar 

  10. Shapley L.D.: On balanced sets and cores. Nav. Res. Logistics Q. 14, 453–460 (1967)

    Article  Google Scholar 

  11. Young H.P.: Monotonic solutions to cooperative games. Int. J. Game Theory 14, 65–72 (1985)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hans Keiding.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Keiding, H. Maximizing selections from the core of a cooperative game. J Glob Optim 50, 107–118 (2011). https://doi.org/10.1007/s10898-011-9668-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9668-3

Keywords

Mathematics Subject Classification (2000)

Navigation