The Core can be accessed in a Bounded Number of Steps
AbstractWe 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 InfoIf 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.
Bibliographic InfoPaper provided by Katholieke Universiteit Leuven, Centrum voor Economische Studiën in its series Center for Economic Studies - Discussion papers with number ces0218.
Date of creation: Mar 2002
Date of revision:
Other versions of this item:
- László Á. Kóczy, 2002. "The Core Can Be Accessed in a Bounded Number of Steps," Game Theory and Information 0202001, EconWPA, revised 04 Feb 2002.
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Karla Vander Weyden).
If references are entirely missing, you can add them using this form.