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
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Apr 2012|
|Contact details of provider:|| Postal: 106-112 boulevard de l'Hôpital 75 647 PARIS CEDEX 13|
Phone: + 33 44 07 81 00
Fax: + 33 1 44 07 83 01
Web page: http://centredeconomiesorbonne.univ-paris1.fr/
More information through EDIRC
References listed on IDEAS
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.:
- 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.
- Alain Chateauneuf & Jean-Yves Jaffray, 2008. "Some Characterizations of Lower Probabilities and Other Monotone Capacities through the Use of Mobius Inversion," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00649208, HAL.
- 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 & 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.
- 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.
- Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 23-38.
- 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.
- repec:hal:journl:hal-00321625 is not listed on IDEAS
- Camelia Bejan & Juan Gómez, 2009. "Core extensions for non-balanced TU-games," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(1), pages 3-16, March.
- Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
- repec:hal:journl:halshs-00445073 is not listed on IDEAS
- Thomson, William, 2003. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey," Mathematical Social Sciences, Elsevier, vol. 45(3), pages 249-297, July.
When requesting a correction, please mention this item's handle: RePEc:mse:cesdoc:12022. 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.