Convergence of the approximate cores to the aspiration core in partitioning games
The approximate core and the aspiration core are two non-empty solutions for cooperative games that have emerged in order to give an answer to cooperative games with an empty core. Although the approximate core and the aspiration core come from two different ideas, we show that both solutions are re...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/60477 |
| Acceso en línea: | http://hdl.handle.net/11336/60477 |
| Access Level: | acceso abierto |
| Palabra clave: | Approximate Core Aspiration Core Convergence Core Partitioning Games https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | The approximate core and the aspiration core are two non-empty solutions for cooperative games that have emerged in order to give an answer to cooperative games with an empty core. Although the approximate core and the aspiration core come from two different ideas, we show that both solutions are related in a very interesting way in partitioning games (or superadditive games). In fact, we prove that the approximate core converges to the aspiration core in partitioning games (or superadditive games). |
|---|