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 game. Based on the concept of k-additivity, we define to 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 : Lucie Label <>
Submitted on : Friday, December 5, 2008 - 6:04:13 PM
Last modification on : Wednesday, March 28, 2018 - 2:38:54 PM
Long-term archiving on : Monday, June 7, 2010 - 9:11:59 PM


Files produced by the author(s)


  • HAL Id : halshs-00344809, version 1



Pedro Miranda, Michel Grabisch. K-balanced games and capacities. 2008. ⟨halshs-00344809⟩



Record views


Files downloads