On the accessibility of core-extensions
AbstractSengupta and Sengupta (1996) study the accessibility of the core of a TU game and show that the core, if non-empty, can be reached from any non-core allocation via a finite sequence of successive blocks. This paper complements the result by showing that when the core is empty, a number of non-empty core-extensions, including the least core and the weak least core (Maschler et al., 1979), the positive core (Orshan and Sudhölter, 2001) and the extended core (Bejan and Gómez, 2009), are accessible in a strong sense, namely each allocation in each of the foregoing core-extensions can be reached from any allocation through a finite sequence of successive blocks.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 74 (2012)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Accessibility; Core; Core-extensions;
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "On the number of blocks required to access the core," MPRA Paper 26578, University Library of Munich, Germany.
- Koczy, Laszlo A., 2006.
"The core can be accessed with a bounded number of blocks,"
Journal of Mathematical Economics,
Elsevier, vol. 43(1), pages 56-64, December.
- Kóczy,László Á., 2005. "The Core Can Be Accessed with a Bounded Number of Blocks," Research Memoranda 042, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
- Laszlo.A.Koczy, 2005. "The Core Can Be Accessed with a Bounded Number of Blocks," IEHAS Discussion Papers 0512, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
- Bernheim, B Douglas & Whinston, Michael D, 1986. "Menu Auctions, Resource Allocation, and Economic Influence," The Quarterly Journal of Economics, MIT Press, vol. 101(1), pages 1-31, February.
- Gooni Orshan & Peter Sudholter, 2001. "The Positive Core of a Cooperative Game," Discussion Paper Series dp268, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
- Klaus, Bettina & Klijn, Flip, 2007.
"Paths to stability for matching markets with couples,"
Games and Economic Behavior,
Elsevier, vol. 58(1), pages 154-171, January.
- Klaus, Bettina & Klijn, Flip, 2007. "Paths to stability for matching markets with couples," Open Access publications from Maastricht University urn:nbn:nl:ui:27-20026, Maastricht University.
- Bettina Klaus & Flip Klijn, 2004. "Paths to Stability for Matching Markets with Couples," Working Papers 156, Barcelona Graduate School of Economics.
- Bettina Klaus & Flip Klijn, 2004. "Paths to Stability for Matching Markets with Couples," UFAE and IAE Working Papers 604.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC), revised 01 Dec 2005.
- Einy, Ezra & Holzman, Ron & Monderer, Dov, 1999. "On the Least Core and the Mas-Colell Bargaining Set," Games and Economic Behavior, Elsevier, vol. 28(2), pages 181-188, August.
- Kaneko, Mamoru & Wooders, Myrna Holtz, 1982.
"Cores of partitioning games,"
Mathematical Social Sciences,
Elsevier, vol. 3(4), pages 313-327, December.
- Effrosyni Diamantoudi & Eiichi Miyagawa & Licun Xue, 2002.
"Random paths to stability in the roommate problem,"
0102-65, Columbia University, Department of Economics.
- Camelia Bejan & Juan Gómez, 2009. "Core extensions for non-balanced TU-games," International Journal of Game Theory, Springer, vol. 38(1), pages 3-16, March.
- Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-80, November.
- Orshan,G. & Sudhoelter,P., 2001.
"The positive core of a cooperative game,"
326, Bielefeld University, Center for Mathematical Economics.
- Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
- Mas-Colell, Andreu, 1989. "An equivalence theorem for a bargaining set," Journal of Mathematical Economics, Elsevier, vol. 18(2), pages 129-139, April.
- Wooders, Myrna, 1978. "Equilibria, the core, and jurisdiction structures in economies with a local public good," Journal of Economic Theory, Elsevier, vol. 18(2), pages 328-348, August.
- Péter Szikora, 2013. "Introduction into the literature of cooperative game theory with special emphasis on dynamic games and the core," Proceedings- 11th International Conference on Mangement, Enterprise and Benchmarking (MEB 2013), Óbuda University, Keleti Faculty of Business and Management.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.