The Core Can Be Accessed with a Bounded Number of Blocks
AbstractWe show the existence of an upper bound for the number of blocks required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of 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.
Bibliographic InfoPaper provided by Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences in its series IEHAS Discussion Papers with number 0512.
Length: 18 pages
Date of creation: Nov 2005
Date of revision:
core; indirect dominance;
Other versions of this item:
- 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 Memorandum 042, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- 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
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
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.:
- Dionysius Glycopantis & Allan Muir & Nicholas C. Yannelis, 2003. "On extensive form implementation of contracts in differential information economies," Economic Theory, Springer, vol. 21(2), pages 495-526, 03.
- László Á. Kóczy & Luc Lauwers, 2001.
"The Coalition Structure Core is Accessible,"
Game Theory and Information
0110001, EconWPA, revised 26 Jun 2002.
- Perry, Motty & Reny, Philip J, 1994.
"A Noncooperative View of Coalition Formation and the Core,"
Econometric Society, vol. 62(4), pages 795-817, July.
- Perry, M. & Rany, P., 1992. "A Non-Cooperative View of Coalition Formation and the Core," UWO Department of Economics Working Papers 9203, University of Western Ontario, Department of Economics.
- Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
- Allan Muir & Nicholas C. Yannelis & Dionysius Glycopantis, 2001. "An extensive form interpretation of the private core," Economic Theory, Springer, vol. 18(2), pages 293-319.
- Green, Jerry R, 1974. "The Stability of Edgeworth's Recontracting Process," Econometrica, Econometric Society, vol. 42(1), pages 21-34, January.
- Diamantoudi, Effrosyni & Miyagawa, Eiichi & Xue, Licun, 2004.
"Random paths to stability in the roommate problem,"
Games and Economic Behavior,
Elsevier, vol. 48(1), pages 18-28, July.
- 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.
- 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.
- Roberto Serrano & Rajiv Vohra, 1997. "Non-cooperative implementation of the core," Social Choice and Welfare, Springer, vol. 14(4), pages 513-525.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2013. "Accessibility and stability of the coalition structure core," Computational Statistics, Springer, vol. 78(2), pages 187-202, October.
- Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
- Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
- Yang, Yi-You, 2012. "On the accessibility of core-extensions," Games and Economic Behavior, Elsevier, vol. 74(2), pages 687-698.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2011. "On the number of blocks required to access the coalition structure core," MPRA Paper 29755, University Library of Munich, Germany.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012.
"An optimal bound to access the core in TU-games,"
38972, University Library of Munich, Germany.
- Szikora Péter, 2011. "Tanítás értelmezhetõ-e, mint egy kooperatív dinamikus játék?," Proceedings- 9th International Conference on Mangement, Enterprise and Benchmarking (MEB 2011), Óbuda University, Keleti Faculty of Business and Management.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Adrienn Foldi).
If references are entirely missing, you can add them using this form.