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.
|Number of pages||9|
|Journal||Journal of Mathematical Economics|
|Publication status||Published - 1 Jan 2006|