An optimal bound to access the core in TU-games

We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n−1 blocks. It turns out that this bound is optimal in the sense there are TU-games for which the number of blocks required to access the core is exactly n−1.

MoreLess

Year of publication:	2013
Authors:	Béal, Sylvain ; Rémila, Eric ; Solal, Philippe
Published in:	Games and Economic Behavior. - Elsevier, ISSN 0899-8256. - Vol. 80.2013, C, p. 1-9
Publisher:	Elsevier

More details

Type of publication:	Article
Classification:	C71 - Cooperative Games
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011049836