The coalition structure core is accessible

László Á. Kóczy () and Luc Lauwers ()

Open Access publications from Katholieke Universiteit Leuven from Katholieke Universiteit Leuven

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.

Keywords: Structure (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations View citations in EconPapers (2) Track citations by RSS feed

Downloads: (external link)
https://lirias.kuleuven.be/bitstream/123456789/121579/1/Dps0219.pdf (application/pdf)

Related works:
Journal Article: The coalition structure core is accessible (2004)
Working Paper: The coalition structure core is accessible (2004)
Working Paper: The Coalition Structure Core is Accessible (2002)
Working Paper: The Coalition Structure Core is Accessible (2002)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:ner:leuven:urn:hdl:123456789/121579

Access Statistics for this paper

More papers in Open Access publications from Katholieke Universiteit Leuven from Katholieke Universiteit Leuven
Series data maintained by Carl Demeyere ().