Axiomatizing core extensions
AbstractWe give an axiomatization of the aspiration core on the domain of all TU-games using a relaxed feasibility condition, non-emptiness, individual rationality, and generalized versions of the reduced game property (consistency) and superadditivity. Our axioms also characterize the C-core (Guesnerie and Oddou, Econ Lett 3(4):301–306, 1979 ; Sun et al. J Math Econ 44(7–8):853–860, 2008 ) and the core on appropriate subdomains. The main result of the paper generalizes Peleg’s (J Math Econ 14(2):203–214, 1985 ) core axiomatization to the entire family of TU-games. Copyright Springer-Verlag 2012
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 InfoArticle provided by Springer in its journal International Journal of Game Theory.
Volume (Year): 41 (2012)
Issue (Month): 4 (November)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
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: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.