E-Prints Complutense

k-Balanced games and capacities

Impacto

Descargas

Último año

Miranda Menéndez, Pedro y Grabisch, Michel (2010) k-Balanced games and capacities. European journal of operational research, 200 (2). pp. 465-472. ISSN 0377-2217

[img] PDF
Restringido a Sólo personal autorizado del repositorio hasta 2020.

255kB

URL Oficial: http://www.sciencedirect.com/science/article/pii/S037722170801062X


URLTipo de URL
http://www.sciencedirect.comEditorial


Resumen

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.


Tipo de documento:Artículo
Palabras clave:Cooperative games; k-Additivity; Balanced games; Capacities; Core
Materias:Ciencias > Matemáticas > Investigación operativa
Código ID:16939
Depositado:31 Oct 2012 09:35
Última Modificación:07 Feb 2014 09:38

Descargas en el último año

Sólo personal del repositorio: página de control del artículo