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ó
Publisher:	Budapest : Hungarian Academy of Sciences, Institute of Economics
Subject:	core \| indirect dominance

More details

Series:	IEHAS Discussion Papers ; MT-DP - 2005/12
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	87258416X [GVK] hdl:10419/108075 [Handle] RePEc:has:discpr:0512 [RePEc]
Classification:	C71 - Cooperative Games ; C73 - Stochastic and Dynamic Games ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis
Source:	EconStor

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