Preserving coalitional rationality for non-balanced games
In cooperative games, the core is one of the most popular solution concept since it ensures coalitional rationality. For non-balanced games however, the core is empty, and other solution concepts have to be found. We propose the use of general solutions, that is, to distribute the total worth of the game among groups rather than among individuals. In particular, the k-additive core proposed by Grabisch and Miranda is a general solution preserving coalitional rationality which distributes among coalitions of size at most k, and is never ampty for k ≥ 2. The extended core of Bejan and Gomez can also be viewed as a general solution, since it implies to give an amount to the grand coalition. The k-additive core being an unbounded set and therefore difficult to use in practice, we propose a subset of it called the minimal bargaining set. The idea is to select elements of the k-additive core minimizing the total amount given to coalitions of size greater than 1. Thus the minimum bargaining set naturally reduces to the core for balanced games. We study this set, giving properties and axiomatizations, as well as its relation to the extended core of Bejan and Gomez. We introduce also the notion of unstable coalition, and show how to find them using the minimum bargaining set. Lastly, we give a method of computing the minimum bargaining set.
|Date of creation:||Apr 2012|
|Date of revision:|
|Note:||View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00718358|
|Contact details of provider:|| Web page: http://hal.archives-ouvertes.fr/|
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.:
- Pedro Miranda & Michel Grabisch, 2008.
"K-balanced games and capacities,"
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers)
- Pedro Miranda & Michel Grabisch, 2010. "k-balanced games and capacities," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00445073, HAL.
- Pedro Miranda & Michel Grabisch, 2008. "K-balanced games and capacities," Documents de travail du Centre d'Economie de la Sorbonne b08079, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Michel Grabisch & Tong Li, 2011. "On the set of imputations induced by the k-additive core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00625339, HAL.
- Chateauneuf, Alain & Jaffray, Jean-Yves, 1989. "Some characterizations of lower probabilities and other monotone capacities through the use of Mobius inversion," Mathematical Social Sciences, Elsevier, vol. 17(3), pages 263-283, June.
- repec:hal:journl:hal-00321625 is not listed on IDEAS
- Grabisch, Michel & Li, Tong, 2011. "On the set of imputations induced by the k-additive core," European Journal of Operational Research, Elsevier, vol. 214(3), pages 697-702, November.
- Michel Grabisch & Pedro Miranda, 2008. "On the vertices of the k-additive core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00321625, HAL.
- Camelia Bejan & Juan Gómez, 2009. "Core extensions for non-balanced TU-games," International Journal of Game Theory, Springer, vol. 38(1), pages 3-16, March.
When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:halshs-00718358. 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: (CCSD)
If references are entirely missing, you can add them using this form.