Stable sets and max‐convex decompositions of TU games

Stable sets and max‐convex decompositions of TU games

0.00 Avg rating0 Votes
Article ID: iaor20134303
Volume: 21
Issue: 2
Start Page Number: 313
End Page Number: 322
Publication Date: Jul 2013
Journal: TOP
Authors: ,
Keywords: decomposition
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.