Accessible outcomes versus absorbing outcomes
(Kóczy and Lauwers, 2004) and (Kóczy and Lauwers, 2007) show that the collection of absorbing outcomes, i.e., the coalition structure core, of a TU game, if non-empty, is a minimal dominant set. The paper complements the result in two respects. First, it is shown that the coalition structure core, if non-empty, can be reached from any outcome via a sequence of successive blocks in quadratic time. Second, we observe that an analogous result holds for accessible outcomes, namely, the collection of accessible outcomes, if non-empty, is a minimal dominant set. Moreover, we give an existence theorem for accessible outcomes, which implies that the minimal dominant set of a cohesive game is exactly the coalition structure core or the collection of accessible outcomes, either of which can be reached from any outcome in linear time.
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.
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.
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.:
- Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
- 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.
- László Á. Kóczy & Luc Lauwers, 2001.
"The Coalition Structure Core is Accessible,"
Game Theory and Information
0110001, EconWPA, revised 26 Jun 2002.
- 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.
- 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).
- Sylvain Béal & Éric Rémila & Philippe Solal, 2012.
"On the number of blocks required to access the core,"
- 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.
- Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "On the Number of Blocks Required to Access the Core," Post-Print halshs-00674426, HAL.
- 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.
- Luc Lauwers, 2002. "A Note on Viable Proposals," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 43(4), pages 1369-1371, November.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:62:y:2011:i:1:p:65-70. 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: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.