Owen coalitional value without additivity axiom

We show that the Owen value for TU games with coalition structure can be characterized without the additivity axiom similarly as it was done by Young for the Shapley value for general TU games. Our axiomatization via four axioms of efficiency, marginality, symmetry across coalitions, and symmetry within coalitions is obtained from the original Owen’s one by the replacement of additivity and null-player via marginality. We show that the alike axiomatization for the generalization of the Owen value suggested by Winter for games with level structure is valid as well. The research was supported by NWO (The Netherlands Organization for Scientific Research) grant NL-RF 047.017.017.     

The multichoice consistent value

We consider multichoice NTU games, i.e., cooperative NTU games in which players can participate in the game with several levels of activity. For these games, we define and characterize axiomatically the multichoice consistent value, which is a generalization of the consistent NTU value for NTU games and of the multichoice value for multichoice TU games. Moreover, we show that this value coincides with the consistent NTU value of a replicated NTU game and we provide a probabilistic interpretation. Received: May 1998/Final version: January 2000     

Axiomatic of the Shapley value of a game with a priori unions

In this paper, we define a modification of the Shapley value for the model of TU games with a priori unions. We provide two characterizations of this value and a new characterization of the Banzhaf–Owen coalitional value.     

The Shapley value as the maximizer of expected Nash welfare

We provide an alternative interpretation of the Shapley value in TU games as the unique maximizer of expected Nash welfare.     

Potential approach and characterizations of a Shapley value in multi-choice games

The main focus of this paper is on the restricted Shapley value for multi-choice games introduced by Derks and Peters [Derks, J., Peters, H., 1993. A Shapley value for games with restricted coalitions. International Journal of Game Theory 21, 351–360] and studied by Klijn et al. [Klijn, F., Slikker, M., Zazuelo, J., 1999. Characterizations of a multi-choice value. International Journal of Game Theory 28, 521–532]. We adopt several characterizations from TU game theory and reinterpret them in the framework of multi-choice games. We generalize the potential approach and show that this solution can be formulated as the vector of marginal contributions of a potential function. Also, we characterize the family of all solutions for multi-choice games that admit a potential. Further, a consistency result is reported.     

A value for multichoice games

A multichoice game is a generalization of a cooperative TU game in which each player has several activity levels. We study the solution for these games proposed by Van Den Nouweland et al. (1995) [Van Den Nouweland, A., Potters, J., Tijs, S., Zarzuelo, J.M., 1995. Cores and related solution concepts for multi-choice games. ZOR-Mathematical Methods of Operations Research 41, 289–311]. We show that this solution applied to the discrete cost sharing model coincides with the Aumann-Shapley method proposed by Moulin (1995) [Moulin, H., 1995. On additive methods to share joint costs. The Japanese Economic Review 46, 303–332]. Also, we show that the Aumann-Shapley value for continuum games can be obtained as the limit of multichoice values for admissible convergence sequences of multichoice games. Finally, we characterize this solution by using the axioms of balanced contributions and efficiency.     

A new basis and the Shapley value

The purpose of this paper is to introduce a new basis of the set of all TU games. Shapley (1953) introduced the unanimity game in which cooperation of all players in a given coalition yields payoff. We introduce the commander game in which only one player in a given coalition yields payoff. The set of the commander games forms a basis and has two properties. First, when we express a game by a linear combination of the basis, the coefficients related to singletons coincide with the Shapley value. Second, the basis induces the null space of the Shapley value.     

A consistent value for games with n players and r alternatives

In Bolger [1993], an efficient value was obtained for a class of games called games with n players and r alternatives. In these games, each of the n players must choose one and only one of the r alternatives. This value can be used to determine a player’s “a priori” value in such a game. In this paper, we show that the value has a consistency property similar to the “consistency” for TU games in Hart/Mas-Colell [1989] and we present a set of axioms (including consistency) which characterizes this value.  The games considered in this paper differ from the multi-choice games considered by Hsiao and Raghavan [1993]. They consider games in which the actions of the players are ordered in the sense that, if i >j, then action i carries more “weight” than action j.  These games also differ from partition function games in that the worth of a coalition depends not only on the partitioning of the players but also on the action chosen by each subset of the partition. Received: April 1994/final version: June 1999     

A value for mixed action-set games

We extend the Aumann-Shapley value to mixed action-set games, i.e., multilevel TU games where there are simultaneously two types of players: discrete players that possess a finite number of activity levels in which they can join a coalition, and continuous players that possess a continuum of levels. Received February 1999/Final version October 2000     

A value for bi-cooperative games

Bi-cooperative games were introduced by Bilbao et al. as a generalization of TU cooperative games, in which each player can participate positively, negatively, or not at all. In this paper, we propose a definition of a share of the worth obtained by some players after they decided on their participation in the game. It turns out that the cost allocation rule does not look for a given player to her contribution at the opposite participation option to the one she chooses. The relevance of the value is discussed on several examples.     

The Compromise Value for Cooperative Games with Random Payoffs

This paper introduces and studies the compromise value for cooperative games with random payoffs, that is, for cooperative games where the payoff to a coalition of players is a random variable. This value is a compromise between utopia payoffs and minimal rights and its definition is based on the compromise value for NTU games and the τ-value for TU games. It is shown that the nonempty core of a cooperative game with random payoffs is bounded by the utopia payoffs and the minimal rights. Consequently, for such games the compromise value exists. Further, we show that the compromise value of a cooperative game with random payoffs coincides with the τ-value of a related TU game if the players have a certain type of preferences. Finally, the compromise value and the marginal value, which is defined as the average of the marginal vectors, coincide on the class of two-person games. This results in a characterization of the compromise value for two-person games.I thank Peter Borm, Ruud Hendrickx and two anonymous referees for their valuable comments.     

A mean value for games with communication structures

The mean value is a new extension of the Shapley value for games with communication structure representable by a simple graph; only pairwise meetings can occur, although some of them might not be permitted. The new value is characterized by a set of axioms of which the one with the most far-reaching effect is an associated consistency property already used in various contexts. The mean value of an n-player unanimity game is the arithmetic average of the mean values of (n–1)-player unanimity games with connected support, which means games in which the deleted players are not articulation point of the considered graph.I wish to thank the anonymous referees for their helpful remarks. The usual disclaimer applies.Received: April 2002/Accepted: February 2004     

Solutions for non-negatively weighted TU games derived from extension operators

We suggest two alternatives to the Lovász-Shapley value for non-negatively weighted TU games, the dual Lovász-Shapley value and the Shapley² value. Whereas the former is based on the Lovász extension operator for TU games, the latter two are based on extension operators that share certain economically plausible properties with the Lovász extension operator, the dual Lovász extension operator and the Shapley extension operator, respectively.     

A dynamic approach to the Shapley value based on associated games

We propose a dynamic process leading to the Shapley value of TU games or any solution satisfying Inessential Game (IG) and Continuity (CONT), based on a modified version of Hamiache's notion of an associated game. The authors are very grateful to William Thomson and two anonymous referees for valuable comments which much improve the paper. They provide better statements and proofs of several major results than the original ones.     

The unit-level-core for multi-choice games: the replicated core for TU games

This note extends the solution concept of the core for traditional transferable-utility (TU) games to multi-choice TU games, which we name the unit-level-core. It turns out that the unit-level-core of a multi-choice TU game is a “replicated subset” of the core of a corresponding “replicated” TU game. We propose an extension of the theorem of Bondareva (Probl Kybern 10:119–139, 1963) and Shapley (Nav Res Logist Q 14:453–460, 1967) to multi-choice games. Also, we introduce the reduced games for multi-choice TU games and provide an axiomatization of the unit-level-core on multi-choice TU games by means of consistency and its converse.     

图上合作博弈和图的边密度

1977年, Myerson建立了以图作为合作结构的可转移效用博弈模型(也称图博弈), 并提出了一个分配规则, 也即"Myerson 值", 它推广了著名的Shapley值. 该模型假定每个连通集合(通过边直接或间接内部相连的参与者集合)才能形成可行的合作联盟而取得相应的收益, 而不考虑连通集合的具体结构. 引入图的局部边密度来度量每个连通集合中各成员之间联系的紧密程度, 即以该连通集合的导出子图的边密度来作为他们的收益系数, 并由此定义了具有边密度的Myerson值, 证明了具有边密度的Myerson值可以由"边密度分支有效性"和"公平性"来唯一确定.     

Axiomatization of the Shapley value using the balanced cycle contributions property

This paper presents an axiomatization of the Shapley value. The balanced cycle contributions property is the key axiom in this paper. It requires that, for any order of all the players, the sum of the claims from each player against his predecessor is balanced with the sum of the claims from each player against his successor. This property is satisfied not only by the Shapley value but also by some other values for TU games. Hence, it is a less restrictive requirement than the balanced contributions property introduced by Myerson (International Journal of Game Theory 9, 169–182, 1980).     

An axiomatization of the Banzhaf value for cooperative games on antimatroids

Cooperative games on antimatroids are cooperative games in which coalition formation is restricted by a combinatorial structure which generalizes permission structures. These games group several well-known families of games which have important applications in economics and politics. The current paper establishes axioms that determine the restricted Banzhaf value for cooperative games on antimatroids. The set of given axioms generalizes the axiomatizations given for the Banzhaf permission values. We also give an axomatization of the restricted Banzhaf value for the smaller class of poset antimatroids. Finally, we apply the above results to auction situations.     

An axiomatization of probabilistic Owen value for games with coalition structure

In the framework of games with coalition structure, we introduce probabilistic Owen value which is an extension of the Owen value and probabilistic Shapley value by considering the situation that not all priori unions are able to cooperate with others. Then we use five axioms of probabilistic efficiency, symmetric within coalitions, symmetric across coalitions applying to unanimity games, strong monotone property and linearity to axiomatize the value.     

Population solidarity, population fair-ranking, and the egalitarian value

We investigate the implications of two axioms specifying how a value should respond to changes in the set of players for TU games. Population solidarity requires that the arrival of new players should affect all the original players in the same direction: all gain together or all lose together. On the other hand, population fair-ranking requires that the arrival of new players should not affect the relative positions of the original players. As a result, we obtain characterizations of the egalitarian value, which assigns to each player an equal share over an individual utility level. It is the only value satisfying either one of the two axioms together with efficiency, symmetry and strategic equivalence.