The Core Can Be Accessed with a Bounded Number of Blocks

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.

MoreLess

Year of publication:	2005
Authors:	Kóczy, László Á.
Institutions:	Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization
Subject:	mathematical economics

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Research Memoranda.
Type of publication:	Book / Working Paper
Language:	English
Notes:	The text is part of a series Research Memoranda Number 042
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005670206