The Core can be accessed in a Bounded Number of Steps

László Kóczy ()

Working Papers of Department of Economics, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, 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.

Date: 2002-03
New Economics Papers: this item is included in nep-gth
References: Add references at CitEc
Citations:

Downloads: (external link)
https://lirias.kuleuven.be/bitstream/123456789/500556/1/Dps0218.pdf

Related works:
Working Paper: The Core can be accessed in a Bounded Number of Steps (2002)
Working Paper: The Core Can Be Accessed in a Bounded Number of Steps (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: https://EconPapers.repec.org/RePEc:ete:ceswps:ces0218

Access Statistics for this paper

More papers in Working Papers of Department of Economics, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, Leuven
Bibliographic data for series maintained by library EBIB ().