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

On the accessibility of the core

Contents:

Author Info

  • Yang, Yi-You

Abstract

We define a new notion of dominance, sequential z-dominance, and show that for any TU game with a nonempty core, every process of successive blocks must terminate in the core if the notion of sequential z-dominance is employed. Moreover, this result leads to an upper bound for the number of blocks needed to reach the core, which is lower than the one given in Kóczy (2006).

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/B6WFW-4YCG03Y-1/2/5b8bc2db463d5b947957a33180313693
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 Games and Economic Behavior.

Volume (Year): 69 (2010)
Issue (Month): 1 (May)
Pages: 194-199

as in new window
Handle: RePEc:eee:gamebe:v:69:y:2010:i:1:p:194-199

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

Related research

Keywords: Core Bargaining process Dominance Accessibility;

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. Laszlo A. Koczy & Luc Lauwers, 2004. "The minimal dominant set is a non-empty core-extension," IEHAS Discussion Papers 0421, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
  2. 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).
  3. 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.
  4. 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. 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.
  2. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
  3. Yang, Yi-You, 2012. "On the accessibility of core-extensions," Games and Economic Behavior, Elsevier, vol. 74(2), pages 687-698.
  4. Péter Szikora, 2012. "Dynamic cooperative models of coalition formation and the core," Proceedings- 10th International Conference on Mangement, Enterprise and Benchmarking (MEB 2012), Óbuda University, Keleti Faculty of Business and Management.
  5. 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.
  6. 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.
  7. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "An optimal bound to access the core in TU-games," MPRA Paper 38972, University Library of Munich, Germany.
  8. 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.
  9. 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.

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:gamebe:v:69:y:2010:i:1:p:194-199. 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.