Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5071800 | Games and Economic Behavior | 2013 | 9 Pages |
Abstract
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.
Related Topics
Social Sciences and Humanities
Economics, Econometrics and Finance
Economics and Econometrics
Authors
Sylvain Béal, Eric Rémila, Philippe Solal,