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.
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 Journal of Mathematical Economics.
Volume (Year): 43 (2006)
Issue (Month): 1 (December)
Contact details of provider:
Web page: http://www.elsevier.com/locate/jmateco
Other versions of this item:
- 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).
- 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.
- 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.:
- László Á. Kóczy & Luc Lauwers, 2002.
"The Coalition Structure Core is Accessible,"
Center for Economic Studies - Discussion papers
ces0219, Katholieke Universiteit Leuven, Centrum voor Economische Studiën.
- Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
- 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.
- 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.
- 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.
- Green, Jerry R, 1974. "The Stability of Edgeworth's Recontracting Process," Econometrica, Econometric Society, vol. 42(1), pages 21-34, January.
- Roberto Serrano & Rajiv Vohra, 1997. "Non-cooperative implementation of the core," Social Choice and Welfare, Springer, vol. 14(4), pages 513-525.
- Effrosyni Diamantoudi & Eiichi Miyagawa & Licun Xue, 2002.
"Random paths to stability in the roommate problem,"
0102-65, Columbia University, Department of Economics.
- 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.
- 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, 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.
- 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, 2010. "On the number of blocks required to access the core," MPRA Paper 26578, University Library of Munich, Germany.
- Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.