关键词: TU博弈, 无圈图博弈, 平均树值, 剩余公平分配

Abstract: This paper considers the worth of the grand coalition no less than the sum of the worth of all components for games with cycle-free communication graph structure. By introducing the property of fair distribution of the surplus, that is, the change in the average payoff of the players in a component is equal to the average payoff of the player in any other component, we propose an efficient solution of cycle-free graph games based on AT value. In addition, we provide its axiomatic characterizations combined with efficiency and component fairness. Especially, we show that the efficient solution is an element of the core for superadditive games with cycle-free communication structure which illustrates good stability. Finally, by analyzing an example applied to the efficient solution, we conclude that the more surplus to the bigger coalitions, the more payoff the key player, that is, the player which possesses the larger degree can gain.

Key words: TU game, cycle-free graph game, average tree value, fair distribution of the surplus