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. (C) 2013 Elsevier Inc. All rights reserved.
机构:
Univ St Etienne, CNRS UMR GATE Lyon St Etienne 5824, St Etienne, France
IXXI, St Etienne, FranceUniv Franche Comte, CRESE, F-25009 Besancon, France
Remila, Eric
Solal, Philippe
论文数: 0引用数: 0
h-index: 0
机构:
Univ St Etienne, CNRS UMR GATE Lyon St Etienne 5824, St Etienne, FranceUniv Franche Comte, CRESE, F-25009 Besancon, France