k-balanced games and capacities

Abstract : In this paper we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of $k$-additivity, we define the so-called $k$-balanced games and the corresponding generalization of core, the $k$-additive core, whose elements are not directly imputations but $k$-additive games. We show that any game is $k$-balanced for a suitable choice of $k,$ so that the corresponding $k$-additive core is not empty. For the games in the $k$-additive core, we propose a sharing procedure to get an imputation and a representative value for the expectations of the players based on the pessimistic criterion. Moreover, we look for necessary and sufficient conditions for a game to be $k$-balanced. For the general case, it is shown that any game is either balanced or 2-balanced. Finally, we treat the special case of capacities.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

Contributor : Michel Grabisch <>
Submitted on : Thursday, January 7, 2010 - 4:22:39 PM
Last modification on : Friday, July 26, 2019 - 11:58:03 AM
Long-term archiving on : Thursday, June 17, 2010 - 8:35:48 PM


Files produced by the author(s)




Pedro Miranda, Michel Grabisch. k-balanced games and capacities. European Journal of Operational Research, Elsevier, 2010, 200 (2), pp.465-472. ⟨10.1016/j.ejor.2008.12.020⟩. ⟨halshs-00445073⟩



Record views


Files downloads