Ir al contenido

Documat


Resumen de Stable sets and max-convex decompositions of TU games

Francesc Llerena Garrés Árbol académico, Carles Rafels Pallarola Árbol académico

  • We study under which conditions the core of a game involved in a max-convex decomposition of another game turns out to be a stable set of the decomposed game. Some applications and numerical examples, including the remarkable Lucas’ five player game with a unique stable set different from the core, are reckoning and analyzed.


Fundación Dialnet

Mi Documat