On the set of imputations induced by the k-additive core
An extension to the classical notion of core is the notion of $k$-additive core, that is, the set of $k$-additive games which dominate a given game, where a $k$-additive game has its Möbius transform (or Harsanyi dividends) vanishing for subsets of more than $k$ elements. Therefore, the 1-additive core coincides with the classical core. The advantages of the $k$-additive core is that it is never empty once $k\geq 2$, and that it preserves the idea of coalitional rationality. However, it produces $k$-imputations, that is, imputations on individuals and coalitions of at most $k$ individuals, instead of a classical imputation. Therefore one needs to derive a classical imputation from a $k$-order imputation by a so-called sharing rule. The paper investigates what set of imputations the $k$-additive core can produce from a given sharing rule.
|Date of creation:||2011|
|Date of revision:|
|Publication status:||Published, European Journal of Operational Research, 2011, 697-702|
|Note:||View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00625339|
|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.:
- 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.
- Hinojosa, M. A. & Marmol, A. M. & Thomas, L. C., 2005. "Core, least core and nucleolus for multiple scenario cooperative games," European Journal of Operational Research, Elsevier, vol. 164(1), pages 225-238, July.
- Miranda, Pedro & Grabisch, Michel, 2010.
"k-Balanced games and capacities,"
European Journal of Operational Research,
Elsevier, vol. 200(2), pages 465-472, January.
- 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, 2009. "The core of games on ordered structures and graphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00445171, HAL.
- Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer, vol. 29(1), pages 23-38.
- Estevez Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2003.
"On the Core of Multiple Longest Traveling Salesman Games,"
2003-127, Tilburg University, Center for Economic Research.
- Estevez-Fernandez, Arantza & Borm, Peter & Hamers, Herbert, 2006. "On the core of multiple longest traveling salesman games," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1816-1827, November.
- Pedro Miranda & Michel Grabisch, 2010. "k-balanced games and capacities," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00445073, 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.
- Pulido, Manuel A. & Sanchez-Soriano, Joaquin, 2006. "Characterization of the core in games with restricted cooperation," European Journal of Operational Research, Elsevier, vol. 175(2), pages 860-869, December.
When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:hal-00625339. 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.