Von Neumann-Morgenstern solution and convex descompositions of TU games
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.
|Date of creation:||2010|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.ere.ub.es
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:bar:bedcje:2010245. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Espai de Recerca en Economia)
If references are entirely missing, you can add them using this form.