An optimal bound to access the core in TU-games
For any transferable utility game in coalitional form with a nonempty core, we show that that the number of blocks required to switch from an imputation out of the core to an imputation in the core is at most n-1, where n is the number of players. This bound exploits the geometry of the core and is optimal. It considerably improves the upper bounds found so far by Koczy (2006), Yang (2010, 2011) and a previous result by ourselves (2012) in which the bound was n(n-1)/2.
If 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.
| Length: | |
| Date of creation: | 23 May 2012 |
| Date of revision: | |
| Handle: | RePEc:pra:mprapa:38972 |
| Contact details of provider: | Postal: Phone: +49-(0)89-2180-2219 Fax: +49-(0)89-2180-3900 Web page: http://mpra.ub.uni-muenchen.de More information through EDIRC
|
References listed on IDEAS
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.:
- Ray, Debraj, 1989. "Credible Coalitions and the Core," International Journal of Game Theory, Springer, vol. 18(2), pages 185-87.
- 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).
- 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.
- Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
- Peleg, B, 1986. "On the Reduced Game Property and Its Converse," International Journal of Game Theory, Springer, vol. 15(3), pages 187-200.
- Kamal Jain & Rakesh Vohra, 2010. "Extendability and von Neuman–Morgenstern stability of the core," International Journal of Game Theory, Springer, vol. 39(4), pages 691-697, October.
- Shellshear, Evan & Sudhölter, Peter, 2009. "On core stability, vital coalitions, and extendability," Games and Economic Behavior, Elsevier, vol. 67(2), pages 633-644, November.
- Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, 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.
- John C. Harsanyi, 1974. "An Equilibrium-Point Interpretation of Stable Sets and a Proposed Alternative Definition," Management Science, INFORMS, vol. 20(11), pages 1472-1495, July.
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:38972. See general 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: (Ekkehart Schlicht)
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.