Von Neumann-Morgenstern solution and convex descompositions of TU games

Abstract

We study under which conditions the core of a game involved in a 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.convex games, cooperative games, stable sets