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Â [greater-or-equal, slanted]Â 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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- 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.
- 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," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00344809, HAL.
- Michel Grabisch, 2009.
"The core of games on ordered structures and graphs,"
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers)
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," PSE - Labex "OSE-Ouvrir la Science Economique" hal-00803233, 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.
- 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.
- 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.
- 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.
- Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer, vol. 29(1), pages 23-38.
- repec:hal:journl:halshs-00445171 is not listed on IDEAS
- 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:halshs-00445073 is not listed on IDEAS
- 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.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:214:y:2011:i:3:p:697-702. 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: (Zhang, Lei)
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.