Advanced Search
MyIDEAS: Login to save this article or follow this journal

Accessible outcomes versus absorbing outcomes

Contents:

Author Info

  • Yang, Yi-You

Abstract

(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.

Download Info

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.
File URL: http://www.sciencedirect.com/science/article/pii/S0165489611000369
Download Restriction: Full text for ScienceDirect subscribers only

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 Info

Article provided by Elsevier in its journal Mathematical Social Sciences.

Volume (Year): 62 (2011)
Issue (Month): 1 (July)
Pages: 65-70

as in new window
Handle: RePEc:eee:matsoc:v:62:y:2011:i:1:p:65-70

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565

Related research

Keywords:

References

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.:
as in new window
  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
  6. 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.
  7. 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.
  8. Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Péter Biró & Gethin Norman, 2013. "Analysis of stochastic matching markets," International Journal of Game Theory, Springer, vol. 42(4), pages 1021-1040, November.
  2. 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.
  3. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2013. "An optimal bound to access the core in TU-games," Games and Economic Behavior, Elsevier, vol. 80(C), pages 1-9.
  4. Péter Szikora, 2013. "Introduction into the literature of cooperative game theory with special emphasis on dynamic games and the core," Proceedings- 11th International Conference on Mangement, Enterprise and Benchmarking (MEB 2013), Óbuda University, Keleti Faculty of Business and Management.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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: (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.