The Core Can Be Accessed with a Bounded Number of Blocks

László Á. Kóczy ()

No 42, Research Memoranda from Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization

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: mathematical economics (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-gth
Date: 2005
View list of references

Downloads: (external link)
http://edocs.ub.unimaas.nl/loader/file.asp?id=1113 (application/pdf)

Related works:
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.

Access Statistics for this paper

More papers in Research Memoranda from Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization
Series data maintained by Willy Villevoye ().