区间值合作对策的广义区间Shapley值

研究区间Shapley值通常对区间值合作对策的特征函数有较多约束,本文研究没有这些约束条件的区间值合作对策,以拓展区间Shapley值的适用范围。首先,本文指出广义H-差在减法与加法运算中存在的问题,进而提出了一种改进的广义H-差,称为扩展的广义H-差。然后,基于扩展的广义H-差,定义了区间值合作对策的广义区间Shapley值,并用区间有效性、区间对称性、区间哑元性和区间可加性等四条公理刻画了该广义区间Shapley值。同时,证明了该值的存在性与唯一性,而且得到了该值的一些性质。研究表明,任意的区间值合作对策的广义区间Shapley值都存在。最后,以算例说明该广义区间Shapley值的可行性与实用性。     

The MC-value for monotonic NTU-games

The MC-value is introduced as a new single-valued solution concept for monotonic NTU-games. The MC-value is based on marginal vectors, which are extensions of the well-known marginal vectors for TU-games and hyperplane games. As a result of the definition it follows that the MC-value coincides with the Shapley value for TU-games and with the consistent Shapley value for hyperplane games. It is shown that on the class of bargaining games the MC-value coincides with the Raiffa-Kalai-Smorodinsky solution. Furthermore, two characterizations of the MC-value are provided on subclasses of NTU-games which need not be convex valued. This allows for a comparison between the MC-value and the egalitarian solution introduced by Kalai and Samet (1985).     

Inheritance of properties in communication situations

In this paper we consider cooperative games in which the possibilities for cooperation between the players are restricted because communication between the players is restricted. The bilateral communication possibilities are modeled by means of a (communication) graph. We are interested in how the communication restrictions influence the game. In particular, we investigate what conditions on the communication graph guarantee that certain appealing properties of the original game are inherited by the graph-restricted game, the game that arises once the communication restrictions are taken into account. We study inheritance of the following properties: average convexity, inclusion of the Shapley value in the core, inclusion of the Shapley values of a game and all its subgames in the corresponding cores, existence of a population monotonic allocation scheme, and the property that the extended Shapley value is a population monotonic allocation scheme. Received May 1998/Revised version January 2000     

Convex multi-choice games: Characterizations and monotonic allocation schemes

This paper focuses on new characterizations of convex multi-choice games using the notions of exactness and superadditivity. Furthermore, level-increase monotonic allocation schemes (limas) on the class of convex multi-choice games are introduced and studied. It turns out that each element of the Weber set of such a game is extendable to a limas, and the (total) Shapley value for multi-choice games generates a limas for each convex multi-choice game.     

A marginalistic value for monotonic set games

In this paper we characterize a value, called a marginalistic value, for monotonic set games, which can be considered to be the analog of the Shapley value for TU-games. For this characterization we use a modification of the strong monotonicity axiom of Young, but the proof is rather different from his.     

Alternative axiomatic characterizations of the Shapley and Banzhaf values

In a paper in 1975, Dubey characterized the Shapley-Shubik index axiomatically on the class of monotonic simple games. In 1979, Dubey and Shapley characterized the Banzhaf index in a similar way. This paper extends these characterizations to axiomatic characterizations of the Shapley and Banzhaf values on the class of control games, on the class of simple games and on the class of all transferable utility games. In particular, it is shown that the additivity axiom which is usually used to characterize these values on the class of all transferable utility games can be weakened without changing the result.This research is sponsored by the Foundation for the Promotion of Research in Economic Sciences, which is part of the Dutch Organization for Scientific Research (NWO).     

单调集对策及合成对策的边缘值

本文给出了单调集对策及其合成对策的边缘值，它类似于我们所熟知的TU—对策的Shapley值及文献[6]．集对策的边缘值的意义在于允许局中人共享项目．这使得不能分割的项目在局中人之间的分配成为可能．我们给出了这种边缘值的一些性质，并讨论了合成集对策的核及其子对策的核之间的关系．     

基于区间与模糊Shapley值的合作收益分配策略

将经典Shapley值三条公理进行拓广,提出具有模糊支付合作对策的Shapley值公理体系。研究一种特殊的模糊支付合作对策,即具有区间支付的合作对策,并且给出了该区间Shapley值形式。根据模糊数和区间数的对应关系,提出模糊支付合作对策的Shapley值,指出该模糊Shapley值是区间支付模糊合作对策的自然模糊延拓。结果表明:对于任意给定置信水平α,若α=1,则模糊Shapley值对应经典合作对策的Shapley值,否则对应具有区间支付合作对策的区间Shapley值。通过模糊数的排序,给出了最优的分配策略。由于对具有模糊支付的合作对策进行比较系统的研究,从而为如何求解局中人参与联盟程度模糊化、支付函数模糊化的合作对策,奠定了一定的基础。     

Multilinear extensions and values for multichoice games

We define multilinear extensions for multichoice games and relate them to probabilistic values and semivalues. We apply multilinear extensions to show that the Banzhaf value for a compound multichoice game is not the product of the Banzhaf values of the component games, in contrast to the behavior in simple games. Following Owen (Manag Sci 18:64–79, 1972), we integrate the multilinear extension over a simplex to construct a version of the Shapley value for multichoice games. We compare this new Shapley value to other extensions of the Shapley value to multichoice games. We also show how the probabilistic value (resp. semivalue, Banzhaf value, Shapley value) of a multichoice game is equal to the probabilistic value (resp. semivalue, Banzhaf value, Shapley value) of an appropriately defined TU decomposition game. Finally, we explain how semivalues, probabilistic values, the Banzhaf value, and this Shapley value may be viewed as the probability that a player makes a difference to the outcome of a simple multichoice game.     

The Shapley value,the Proper Shapley value,and sharing rules for cooperative ventures

In this note, we discuss two solutions for cooperative transferable utility games, namely the Shapley value and the Proper Shapley value. We characterize positive Proper Shapley values by affine invariance and by an axiom that requires proportional allocation of the surplus according to the individual singleton worths in generalized joint venture games. As a counterpart, we show that affine invariance and an axiom that requires equal allocation of the surplus in generalized joint venture games characterize the Shapley value.     

A Shapley function on a class of cooperative fuzzy games

In this paper, we make a study of the Shapley values for cooperative fuzzy games, games with fuzzy coalitions, which admit the representation of rates of players' participation to each coalition. A Shapley function has been introduced by another author as a function which derives the Shapley value from a given pair of a fuzzy game and a fuzzy coalition. However, the previously proposed axioms of the Shapley function can be considered unnatural. Furthermore, the explicit form of the function has been given only on an unnatural class of fuzzy games. We introduce and investigate a more natural class of fuzzy games. Axioms of the Shapley function are renewed and an explicit form of the Shapley function on the natural class is given. We make sure that the obtained Shapley value for a fuzzy game in the natural class has several rational properties. Finally, an illustrative example is given.     

The Shapley value for cooperative games under precedence constraints

Cooperative games are considered where only those coalitions of players are feasible that respect a given precedence structure on the set of players. Strengthening the classical symmetry axiom, we obtain three axioms that give rise to a unique Shapley value in this model. The Shapley value is seen to reflect the expected marginal contribution of a player to a feasible random coalition, which allows us to evaluate the Shapley value nondeterministically. We show that every exact algorithm for the Shapley value requires an exponential number of operations already in the classical case and that even restriction to simple games is #P-hard in general. Furthermore, we outline how the multi-choice cooperative games of Hsiao and Raghavan can be treated in our context, which leads to a Shapley value that does not depend on pre-assigned weights. Finally, the relationship between the Shapley value and the permission value of Gilles, Owen and van den Brink is discussed. Both refer to formally similar models of cooperative games but reflect complementary interpretations of the precedence constraints and thus give rise to fundamentally different solution concepts.     

Monotonic solutions of cooperative games

The principle of monotonicity for cooperative games states that if a game changes so that some player's contribution to all coalitions increases or stays the same then the player's allocation should not decrease. There is a unique symmetric and efficient solution concept that is monotonic in this most general sense — the Shapley value. Monotonicity thus provides a simple characterization of the value without resorting to the usual “additivity” and “dummy” assumptions, and lends support to the use of the value in applications where the underlying “game” is changing, e.g. in cost allocation problems.     

Random marginal and random removal values

We propose two variations of the non-cooperative bargaining model for games in coalitional form, introduced by Hart and Mas-Colell (Econometrica 64:357–380, 1996a). These strategic games implement, in the limit, two new NTU-values: the random marginal and the random removal values. Their main characteristic is that they always select a unique payoff allocation in NTU-games. The random marginal value coincides with the Consistent NTU-value (Maschler and Owen in Int J Game Theory 18:389–407, 1989) for hyperplane games, and with the Shapley value for TU games (Shapley in In: Contributions to the theory of Games II. Princeton University Press, Princeton, pp 307–317, 1953). The random removal value coincides with the solidarity value (Nowak and Radzik in Int J Game Theory 23:43–48, 1994) in TU-games. In large games we show that, in the special class of market games, the random marginal value coincides with the Shapley NTU-value (Shapley in In: La Décision. Editions du CNRS, Paris, 1969), and that the random removal value coincides with the equal split value.      

The Shapley value for bicooperative games

The aim of the present paper is to study a one-point solution concept for bicooperative games. For these games introduced by Bilbao (Cooperative Games on Combinatorial Structures, 2000) , we define a one-point solution called the Shapley value, since this value can be interpreted in a similar way to the classical Shapley value for cooperative games. The main result of the paper is an axiomatic characterization of this value.     

A shapley value for games with restricted coalitions

A restriction is a monotonic projection assigning to each coalition of a finite player setN a subcoalition. On the class of transferable utility games with player setN, a Shapley value is associated with each restriction by replacing, in the familiar probabilistic formula, each coalition by the subcoalition assigned to it. Alternatively, such a Shapley value can be characterized by restricted dividends. This method generalizes several other approaches known in literature. The main result is an axiomatic characterization with the property that the restriction is determined endogenously by the axioms.     

Nonsymmetric values under Hart-Mass-Colell consistency

Let f be a single valued solution for cooperative TU games that satisfies inessential game property, efficiency, Hart Mas-Colell consistency and for two person games is strictly monotonic and individually unbounded. Then there exists a family of strictly increasing functions associated with players that completely determines f. For two person games, both players have equal differences between their functions at the solution point and at the values of characteristic function of their singletons. This solution for two person games is uniquely extended to n person games due to consistency and efficiency. The extension uses the potential with respect to the family of functions and generalizes potentials introduced by Hart and Mas Colell [6]. The weighted Shapley values, the proportional value described by Ortmann [11], and new values generated by power functions are among these solutions. The author is grateful to anonymous referee and Associate Editor for their comments and suggestions.     

具有区间联盟值n人对策的Shapley值

本文提出了一类具有区间联盟收益值n人对策的Shapley值.利用区间数运算有关理论,通过建立公理化体系,对具有区间联盟收益值n人对策的Shapley值进行深入研究,证明了这类n人对策Shapley值存在性与唯一性,并给出了此Shapley值的具体表达式及一些性质.最后通过一个算例检验了其有效性与正确性.     

最小成本生成树对策上Shapley值的新刻画及其应用

2002年,Kar利用有效性、无交叉补贴性、群独立性和等处理性四个公理对最小成本生成树对策上的Shapley值进行了刻画。本文提出了“群有效性”这一公理,利用这一公理和“等处理性”两个公理,给出了最小成本生成树对策上Shapley值的一种新的公理化刻画。最后,运用最小成本生成树对策的Shapley值,对网络服务的费用分摊问题进行了分析。     

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.