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.core, indirect dominance

Laszlo.A.Koczy

Research Papers in Economics

English

A dynamic theory for the class of games with nonempty cores.

A property of the core.

An extensive form interpretation of the private core.

Global stability in n-person games.

K¶ oczy and Luc Lauwers. The coalition structure core is accessible.

Non-cooperative implementation of the core.

On extensive form implementation of contracts in di®erential information economies.

Primitive recursive functions. Eric Weisstein's World of Mathematics,

Recursive Functions. Akad¶ emiai,

The stability of Edgeworth's recontracting process.

Viable proposals.

The Core Can Be Accessed with a Bounded Number of Blocks