The Core Can Be Accessed with a Bounded Number of Blocks

László Á. Kóczy ()

No 512, IEHAS Discussion Papers from Institute of Economics, Hungarian Academy of Sciences

Abstract: We show the existence of an upper bound for the number of blocks 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 blocks.

Keywords: core; indirect dominance (search for similar items in EconPapers)
JEL-codes: C71 C73 C61 (search for similar items in EconPapers)
Date: 2005-11
View list of references

Downloads: (external link)
http://econ.core.hu/doc/dp/dp/mtdp0512.pdf (application/pdf)

Related works:
Working Paper: The Core Can Be Accessed with a Bounded Number of Blocks (2005)
Journal Article: The core can be accessed with a bounded number of blocks (2006)
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:has:discpr:0512

Access Statistics for this paper

More papers in IEHAS Discussion Papers from Institute of Economics, Hungarian Academy of Sciences
Contact information at EDIRC.
Series data maintained by Zsuzsa Balabán ().