Artículo
Finding the nucleolus of any n-person cooperative game by a single linear program
Autor/es | Puerto Albandoz, Justo
Perea Rojas-Marcos, Federico |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2013-10 |
Fecha de depósito | 2016-07-07 |
Publicado en |
|
Resumen | In this paper we show a new method for calculating the nucleolus by solving
a unique minimization linear program with O(4n) constraints whose coeffi-
cients belong to {−1, 0, 1}. We discuss the need of having all these ... In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with O(4n) constraints whose coeffi- cients belong to {−1, 0, 1}. We discuss the need of having all these constraints and empirically prove that they can be reduced to O(kmax2 n), where kmax is a positive integer comparable with the number of players. A computational experience shows the applicability of our method over (pseudo)random transferable utility cooperative games with up to 18 players. |
Identificador del proyecto | FQM-5849
MTM2010-19576-C02-01 |
Cita | Puerto Albandoz, J. y Perea Rojas-Marcos, F. (2013). Finding the nucleolus of any n-person cooperative game by a single linear program. Computers & Operations Research, 40 (10), 2308-2313. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Finding the nucleolus of any ... | 177.9Kb | [PDF] | Ver/ | |