On the number of blocks required to access the coalition structure core
AbstractThis article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or equal to (n*n+4n)/4, where n is the cardinality of the player set. This number considerably improves the upper bound found so far by Koczy and Lauwers (2004).
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 University Library of Munich, Germany in its series MPRA Paper with number 29755.
Date of creation: 22 Mar 2011
Date of revision:
coalition structure core; excess function; payoff configuration; outsider independent domination.;
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:
- NEP-ALL-2011-04-16 (All new papers)
- NEP-CDM-2011-04-16 (Collective Decision-Making)
- NEP-GTH-2011-04-16 (Game Theory)
- NEP-NET-2011-04-16 (Network Economics)
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.:
- László Á. Kóczy & Luc Lauwers, 2001.
"The Coalition Structure Core is Accessible,"
Game Theory and Information
0110001, EconWPA, revised 26 Jun 2002.
- 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.
- 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.
- Kóczy,László Á., 2005. "The Core Can Be Accessed with a Bounded Number of Blocks," Research Memorandum 042, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Sengupta, Abhijit & Sengupta, Kunal, 1994. "Viable Proposals," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 35(2), pages 347-59, May.
- Robert Aumann, 2010. "Some non-superadditive games, and their Shapley values, in the Talmud," International Journal of Game Theory, Springer, vol. 39(1), pages 3-10, March.
- Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
- Greenberg, Joseph, 1994. "Coalition structures," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 37, pages 1305-1337 Elsevier.
- Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
- Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," IEHAS Discussion Papers 1211, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.