The bounded core for games with precedence constraints
An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the union of all bounded faces of the core, it is nonempty if the core is nonempty, and it is a continuous correspondence on games with coinciding precedence constraints. If the precedence constraints generate a connected hierarchy, then the core is always nonempty. It is shown that the bounded core is axiomatized similarly to the core for classical cooperative games, namely by boundedness (BOUND), nonemptiness for zero-inessential two-person games (ZIG), anonymity, covariance under strategic equivalence (COV), and certain variants of the reduced game property (RGP), the converse reduced game property (CRGP), and the reconfirmation property. The core is the maximum solution that satisfies a suitably weakened version of BOUND together with the remaining axioms. For games with connected hierarchies, the bounded core is axiomatized by BOUND, ZIG, COV, and some variants of RGP and CRGP, whereas the core is the maximum solution that satisfies the weakened version of BOUND, COV, and the variants of RGP and CRGP.
|Date of creation:||Jan 2012|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://centredeconomiesorbonne.univ-paris1.fr/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Derks, Jean J M & Gilles, Robert P, 1995. "Hierarchical Organization Structures and Constraints on Coalition Formation," International Journal of Game Theory, Springer, vol. 24(2), pages 147-63.
- Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer, vol. 21(3), pages 249-66.
- Peleg, B, 1986. "On the Reduced Game Property and Its Converse," International Journal of Game Theory, Springer, vol. 15(3), pages 187-200.
- Peter Sudhölter & Yan-An Hwang, 2001. "Axiomatizations of the core on the universal domain and other natural domains," International Journal of Game Theory, Springer, vol. 29(4), pages 597-623.
- Michel Grabisch, 2010.
"Ensuring the boundedness of the core of games with restricted cooperation,"
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers)
- Michel Grabisch, 2010. "Ensuring the boundedness of the core of games with restricted cooperation," Documents de travail du Centre d'Economie de la Sorbonne 10093, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00650964, HAL.
- Bezalel Peleg & Peter Sudholter, 2004. "Bargaining Sets of Voting Games," Discussion Paper Series dp376, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
When requesting a correction, please mention this item's handle: RePEc:mse:cesdoc:12006. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lucie Label)
If references are entirely missing, you can add them using this form.