On the number of blocks required to access the core
For any transferable utility game in coalitional form with 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 less than or equal to n(n-1)/2, where n is the cardinality of the player set. This number considerably improves the upper bounds found so far by Koczy (2006) and Yang (2010). Our result relies on an altered version of the procedure proposed by Sengupta and Sengupta (1996). The use of the Davis-Maschler reduced-games is also pointed out.
|Date of creation:||09 Nov 2010|
|Date of revision:|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://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.:
- Béal, Sylvain & Durieu, Jacques & Solal, Philippe, 2008.
"Farsighted coalitional stability in TU-games,"
Mathematical Social Sciences,
Elsevier, vol. 56(3), pages 303-313, November.
- Béal, Sylvain & Durieu, Jacques & Solal, Philippe, 2007. "Farsighted coalitional stability in TU-games," Papers 07-57, Sonderforschungsbreich 504.
- Sylvain Béal & Jacques Durieu & Philippe Solal, 2007. "Farsighted Coalitional Stability in TU-Games," Post-Print ujm-00176488, HAL.
- Béal, Sylvain & Durieu, Jacques & Solal, Philippe, 2007. "Farsighted Coalitional Stability in TU-games," Sonderforschungsbereich 504 Publications 07-57, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Sylvain Béal & Jacques Durieu & Philippe Solal, 2008. "Farsighted Coalitional Stability in TU-games," Post-Print hal-00334049, HAL.
- Sylvain Béal & Jacques Durieu & Philippe Solal, 2007. "Farsighted Coalitional Stability in TU-Games," Post-Print ujm-00176491, HAL.
- Sylvain Béal & Jacques Durieu & Philippe Solal, 2007. "Farsighted Coalitional Stability in TU-Games," Post-Print ujm-00162456, HAL.
- 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).
- 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.
- Maniquet, Francois, 2003.
"A characterization of the Shapley value in queueing problems,"
Journal of Economic Theory,
Elsevier, vol. 109(1), pages 90-103, March.
- Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- MANIQUET, François, . "A characterization of the Shapley value in queueing problems," CORE Discussion Papers RP 1662, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
- Manea, Mihai, 2007. "Core tatonnement," Journal of Economic Theory, Elsevier, vol. 133(1), pages 331-349, March.
- 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, Game Theory Society, vol. 15(3), pages 187-200.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:26578. 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: (Joachim Winter)
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.