k-balanced games and capacities - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2010

k-balanced games and capacities

Résumé

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.
Fichier principal
Vignette du fichier
ejor08-miranda.pdf (204.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-00445073 , version 1 (07-01-2010)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More