The core can be accessed with a bounded number of blocks

László Á. Kóczy

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:	November 2005
Authors:	Kóczy, László Á.
Publisher:	Budapest : Institute of Economics, Hungarian Academy of Sciences
Subject:	core \| indirect dominance \| Spieltheorie \| Game theory \| Core

freely available

Full text |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

Extent:	1 Online-Ressource (circa 19 Seiten) Illustrationen
Series:	Mu̐helytanulmányok / Magyar Tudományos Akadémia, Közgazdaságtudományi Intézet. - Budapest : [Verlag nicht ermittelbar], ISSN 1785-377X, ZDB-ID 2276849-X. - Vol. MT-DP. 2005, 12
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Graue Literatur ; Non-commercial literature ; Arbeitspapier ; Working Paper
Language:	English
Notes:	Erscheint auch als Druck-Ausgabe Zusammenfassung in ungarischer Sprache
ISBN:	963-9588-55-5
Other identifiers:	hdl:10419/108075 [Handle]
Classification:	C71 - Cooperative Games ; C73 - Stochastic and Dynamic Games ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis
Source:	ECONIS - Online Catalogue of the ZBW

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