Skip to main content

The Core for Games with Cooperation Structure

  • Chapter
  • First Online:
Transactions on Computational Collective Intelligence XXIII

Part of the book series: Lecture Notes in Computer Science ((TCCI,volume 9760))

Abstract

A cooperative game consists of a set of players and a characteristic function that determines the maximal profit or minimal cost that each subset of players can get when they decide to cooperate, regardless of the actions of the rest of the players. The relationships among the players can modify their bargaining and therefore their payoffs. The model of cooperation structures in a game introduces a graph on the set of players setting their relations and in which its components indicate the groups of players that are initially formed. In this paper we define the core and the Weber set and the notion of convexity for this family of games.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Adam, L., Kroupa, T.: The intermediate set and limiting superdifferential for coalition games: between the core and the Weber Set. Preprint submitted to Games and Economic Behavior (2015)

    Google Scholar 

  2. Aumann, R.J., Drèze, J.H.: Cooperative games with coalition structures. Int. J. Game Theory 3, 217–237 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  3. Casajus A.: Beyond basic structures in game theory. Ph.D. thesis. University of Leipzig, Germany (2007)

    Google Scholar 

  4. Faigle, U.: Cores of games with restricted cooperation. Methods Models Oper. Res. 33, 405–422 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fernández, J.R., Gallego, I., Jiménez-Losada, A., Ordóñez, M.: Cooperation among agents with a proximity relation. Eur. J. Oper. Res. 250, 555–565 (2015)

    Article  MathSciNet  Google Scholar 

  6. Gillies, D.B.: Solutions to general non-zero-sum games. In: Tucker, A.W., Luce, R.D. (eds.) Contributions to the Theory of Games IV. Annals of Mathematics, vol. 40, 47th edn, p. 85. Princeton University Press, Princeton (1959)

    Google Scholar 

  7. Grabisch, M.: The core of games on ordered structures and graphs. Q. J. Oper. Res. 7, 207–238 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ichiishi, T.: Super-modularity: applications to the convex and to the greedy algorithm for LP. J. Econ. Theory 25, 283–286 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  9. Myerson, R.B.: Graphs and cooperation in games. Math. Oper. Res. 2(3), 225–229 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  10. van den Nouweland, A., Borm, P.: On the convexity of communication games. Int. J. Game Theory 19, 421–430 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Owen, G.: Values of games with a priori unions. In: Henn, R., Moeschlin, O. (eds.) Mathematical Economics and Game Theory. Lecture Notes in Economics and Mathematical Systems, vol. 141, pp. 76–88. Springer, Heidelberg (1977)

    Chapter  Google Scholar 

  12. Pulido, M.A., Sánchez-Soriano, J.: Characterization of the core in games with restricted cooperation. Eur. J. Oper. Res. 175, 860–869 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pulido, M.A., Sánchez-Soriano, J.: On the core, the Weber set and convexity in games with a priori unions. Eur. J. Oper. Res. 193, 468–475 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Shapley, L.S.: A value for \(n\)-person games. Ann. Math. Stud. 28, 307–317 (1953)

    MathSciNet  MATH  Google Scholar 

  15. Shapley, L.S.: Cores and convex games. Int. J. Game Theory 1, 1–26 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  16. Weber, R.J.: Probabilistic values for games. Cowles Foundation Discussion Paper 417R. Yale University, New Haven (1978)

    Google Scholar 

  17. Weber, R.J.: Probabilistic values for games. In: Roth, A. (ed.) The Shapley value: Essays in Honor of Lloyd S. Shapley, pp. 101–119. Cambridge University Press, Cambridge (1988)

    Chapter  Google Scholar 

Download references

Acknowledgments

This research has been partially supported by the Spanish Ministry of Economy and Competitiveness ECO2013-40755-P, and by the FQM237 grant of the Andalusian Government.

The second author thanks the Agence Nationale de la Recherche for financial support under contract ANR-13-BSHS1-0010 (DynaMITE).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Inés Gallego .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gallego, I., Grabisch, M., Jiménez-Losada, A., Skoda, A. (2016). The Core for Games with Cooperation Structure. In: Nguyen, N., Kowalczyk, R., Mercik, J. (eds) Transactions on Computational Collective Intelligence XXIII. Lecture Notes in Computer Science(), vol 9760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-52886-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-52886-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-52885-3

  • Online ISBN: 978-3-662-52886-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics