Advanced Search
MyIDEAS: Login

The coalition structure core is accessible

Contents:

Author Info

  • Koczy, L
  • Lauwers, Luc

Abstract

We prove the existence of an upper bound for the number of blockings required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blockings. Primitive recursive algorithms are provided to locate accessibility paths.

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: https://lirias.kuleuven.be/bitstream/123456789/121579/1/Dps0219.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Katholieke Universiteit Leuven in its series Open Access publications from Katholieke Universiteit Leuven with number urn:hdl:123456789/121579.

as in new window
Length:
Date of creation: 2002
Date of revision:
Handle: RePEc:ner:leuven:urn:hdl:123456789/121579

Contact details of provider:
Web page: http://www.kuleuven.be

Related research

Keywords: Structure;

Other versions of this item:

Find related papers by JEL classification:

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. Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
  2. 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.
  3. Green, Jerry R, 1974. "The Stability of Edgeworth's Recontracting Process," Econometrica, Econometric Society, vol. 42(1), pages 21-34, January.
  4. DIAMANTOUDI, Effrosyni & XUE, Licun, 2002. "Coalitions, agreements and efficiency," CORE Discussion Papers 2002047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  5. 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.
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¢ & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Dani‰l Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," IEHAS Discussion Papers 1211, Institute of Economics, Hungarian Academy of Sciences.
  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. László Á. Kóczy & Luc Lauwers, 2002. "The Minimal Dominant Set is a Non-Empty Core-Extension," Game Theory and Information 0210002, EconWPA.
  4. Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
  5. Cesco, Juan Carlos, 2008. "A general characterization for non-balanced games in terms of U-cycles," European Journal of Operational Research, Elsevier, vol. 191(2), pages 409-415, December.
  6. Gabrielle Demange, 2006. "The strategy structure of some coalition formation games," PSE Working Papers halshs-00590290, HAL.
  7. 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.
  8. 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.
  9. Gabrielle Demange, 2006. "The strategy structure of some coalition formation games," Working Papers halshs-00590290, HAL.
  10. 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.
  11. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.

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:ner:leuven:urn:hdl:123456789/121579

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Carl Demeyere).

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.