On Shift-Invariant Solutions for TU-Games

摘要

1.Introduction and Preliminaries In a TU-game any player should not take more from the game than his maximal incremental contribution to any coalition. A payoff that exceeds this contribution may be regarded unreasonable for the player. The reasonable set of a cooperative game is the set of all payoff vectors that are reasonable in this sense, and it was first introduced by Milnor [5]. Adding a concept of minimal incremental contribution, Gerard-Varet and Zamir [1] defined a set of reasonable outcomes and justified it by axiomatization. These sets as well as the imputation set are considered as pre-solution-concepts. It is asserted not that outcomes within the sets are necessarily plausible, but only that those outside the sets are implausible.