Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/108075
Authors: 
Kóczy, László
Year of Publication: 
2005
Series/Report no.: 
IEHAS Discussion Papers MT-DP - 2005/12
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.
Subjects: 
core
indirect dominance
JEL: 
C71
C73
C61
Document Type: 
Working Paper

Files in This Item:
File
Size
349.14 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.