Von Neumann-Morgenstern solution and convex descompositions of TU games
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Universitat de Barcelona. Espai de Recerca en Economia in its series Working Papers in Economics with number 245.
Length: 0 pages
Date of creation: 2010
Date of revision:
Contact details of provider:
Postal: Espai de Recerca en Economia, Facultat de CiÃ¨ncies EconÃ²miques. Tinent Coronel Valenzuela, Num 1-11 08034 Barcelona. Spain.
Web page: http://www.ere.ub.es
More information through EDIRC
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.