On the set of imputations induced by the k-additive core

Abstract : 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.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

Contributor : Michel Grabisch <>
Submitted on : Thursday, September 22, 2011 - 5:14:37 PM
Last modification on : Tuesday, March 27, 2018 - 11:48:05 AM
Long-term archiving on : Friday, December 23, 2011 - 2:30:45 AM


Files produced by the author(s)


  • HAL Id : hal-00625339, version 2



Michel Grabisch, Tong Li. On the set of imputations induced by the k-additive core. European Journal of Operational Research, Elsevier, 2011, pp.697-702. ⟨hal-00625339v2⟩



Record views


Files downloads