Finding the nucleolus of any n-person cooperative game by a single linear program
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 k...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/43320 |
| Acceso en línea: | http://hdl.handle.net/11441/43320 https://doi.org/10.1016/j.cor.2013.03.011 |
| Access Level: | acceso abierto |
| Palabra clave: | Cooperative games Nucleolus Order median problem |
| Sumario: | 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. |
|---|