The Core can be accessed in a Bounded Number of Steps
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 of creation:||Mar 2002|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +32-(0)16-32 67 25
Fax: +32-(0)16-32 67 96
Web page: http://www.econ.kuleuven.be/ew
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ete:ceswps:ces0218. 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: (Karla Vander Weyden)
If references are entirely missing, you can add them using this form.