Some properties for probabilistic and multinomial (probabilistic) values on cooperative games

We investigate the conditions for the coefficients of probabilistic and multinomial values of cooperative games necessary and/or sufficient in order to satisfy some properties, including marginal contributions, balanced contributions, desirability relation and null player exclusion property. Moreover, a similar analysis is conducted for transfer property of probabilistic power indices on the domain of simple games.     

The Shapley value for arbitrary families of coalitions

We address the problem of finding a suitable definition of a value similar to that of Shapley’s, when the games are defined on a subfamily of coalitions with no structure. We present two frameworks: one based on the familiar efficiency, linearity and null player axioms, and the other on linearity and the behavior on unanimity games. We give several properties and examples in each case, and give necessary and sufficient conditions on the family of coalitions for the approaches to coincide.     

Weighted Shapley hierarchy levels values

A new class of values for cooperative games with level structure is introduced. We apply a multi-step proceeding to the weighted Shapley values. For characterization, two well-known axiomatizations of the weighted Shapley values are extended, the first one by efficiency and weighted balanced contributions and the second one by weighted standardness for two-player games and consistency. We get a new axiomatization of the Shapley levels value too.     

The not-quite non-atomic game: Homogeneous games on two measures

The space of continuous, piecewise smooth homogeneous functions of degree one in two variables can be generated by linear functions and by functions which are the minimum of two linear expressions. This permits a representation of the value for homogeneous games on two measures in terms of the values of additive games and of “shoe-like” games. We treat several examples in detail.     

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.     

A new family of regular semivalues and applications

We define a new family of values for cooperative games, including as a particular case the Shapley value. They are defined on the collection of the unanimity games, then extended by linearity. Our most relevant result shows that the family of the weighting coefficients characterizing the values so defined is an open curve on the simplex of the regular semivalues. We give an explicit formula for the values when the parameter characterizing the family is a natural number and we offer an algorithm to calculate them in weighted majority games, slightly extending previous results (see Bilbao et al., TOP, 8:191–213, 2000). The paper ends with two applications. The first one is classical, and serves to see how the indices behave with respect to the Shapley and Banzhaf values in the case of the EU parliament and in the UN Security Council. The second one is much more recent: it deals with the microarray games, introduced in Moretti et al. (TOP, 15:256–280, 2007), which are average of unanimity games. The idea is to rank genes taken from DNA of patients affected by a specific disease, with the aim of singling out a group of genes potentially responsible of the disease. In this last case we consider some microarray data available on the net and concerning some specific diseases and we show that several genes mentioned in the medical literature as potentially responsible for the onset of the disease are present in the first places according to our rankings.     

Algebraic structure of games

Game theory and algebra become inextricably intertwined once one recognizes that the notion of a permutation of players gives rise to a representation of the symmetric group in the space of automorphisms of the vector space of games. In this paper the authors utilize this observation to attempt to turn the typical approach to game-theoretic problems on its head by analyzing the space of games from an algebraic viewpoint. In this way we find, quite surprisingly, that it is the notion of inessential, or additive, games, previously thought to be of little or no interest, that is of prime significance in describing the structure of the space of games.     

Symmetric solutions for symmetric,constant-sum,extreme games with four values

Symmetric, constant-sum, extreme games with four values were fully characterized inRosenmüller [1977]. Symmetric solutions (or symmetric stable sets) for these games are studied. As a result, it is shown that all such games have at least one symmetric solution.     

关于一元多项式的除法

着重介绍一种由两个一元多项式的系数变换进行多项式整除性的研究方法 ,在进行多项式整除性的研究时 ,这种方法简单、实用、易懂 ,这种方法还可进一步推广用之于求一元多项式的最大公因式以及一元多项式互素等方面的研究 .     

Linear values for interior operator games

Interior operator games were introduced by Bilbao et al. (2005) as additive games restricted by antimatroids. In that paper several interesting cooperative games were shown as examples of interior operator games. The antimatroid is a known combinatorial structure which represents, in the game theory context, a dependence system among the players. The aim of this paper is to study a family of values which are linear functions and satisfy reasonable conditions for interior operator games. Two classes of these values are considered assuming particular properties.     

On ordinal equivalence of the Shapley and Banzhaf values for cooperative games

In this paper I consider the ordinal equivalence of the Shapley and Banzhaf values for TU cooperative games, i.e., cooperative games for which the preorderings on the set of players induced by these two values coincide. To this end I consider several solution concepts within semivalues and introduce three subclasses of games which are called, respectively, weakly complete, semicoherent and coherent cooperative games. A characterization theorem in terms of the ordinal equivalence of some semivalues is given for each of these three classes of cooperative games. In particular, the Shapley and Banzhaf values as well as the segment of semivalues they limit are ordinally equivalent for weakly complete, semicoherent and coherent cooperative games.     

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).     

Atomic weights and the combinatorial game of bipass

We define an all-small ruleset, bipass, within the framework of normal play combinatorial games. A game is played on finite strips of black and white stones. Stones of different colors are swapped provided they do not bypass one of their own kind. We find a simple surjective function from the strips to integer atomic weights (Berlekamp, Conway and Guy 1982) that measures the number of units in all-small games. This result provides explicit winning strategies for many games, and in cases where it does not, it gives narrow bounds for the canonical form game values. We find game values for some parametrized families of games, including an infinite number of strips of value ?, and we prove that the game value ?2 does not appear as a disjunctive sum of bipass. Lastly, we define the notion of atomic weight tameness, and prove that optimal misére play bipass resembles optimal normal play.     

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.     

Semi-marginalistic Values for Set Games

Concerning the solution theory for set games, the paper focuses on a family of values, each of which allocates to any player some type of marginalistic contribution with respect to any coalition containing the player. For any value of the relevant family, an axiomatization is given by means of three properties, namely one type of an efficiency property, the equal treatment property and one type of a monotonicity property. We present one proof technique which is based on the decomposition of any arbitrary set game into a union of simple set games, the value of which are much easier to determine. A simple set game is associated with an arbitrary, but fixed item of the universe.     

Values for Interior Operator Games

The aim of this paper is to study a new class of cooperative games called interior operator games. These games are additive games restricted by antimatroids. We consider several types of cooperative games as peer group games, big boss games, clan games and information market games and show that all of them are interior operator games. Next, we analyze the properties of these games and compute the Shapley, Banzhaf and Tijs values.     

Biprobabilistic values for bicooperative games

The present paper introduces bicooperative games and develops some general values on the vector space of these games. First, we define biprobabilistic values for bicooperative games and observe in detail the axioms that characterize such values. Following the work of Weber [R.J. Weber, Probabilistic values for games, in: A.E. Roth (Ed.), The Shapley Value: Essays in Honor of Lloyd S. Shapley Cambridge University Press, Cambridge, 1988, pp. 101–119], these axioms are sequentially introduced observing the repercussions they have on the value expression. Moreover, compatible-order values are introduced and there is shown the relationship between these values and efficient values such that their components are biprobabilistic values.     

Weighted values for non-atomic games: an axiomatic approach

Weighted values of non-atomic games were introduced by Hart and Monderer. These values have been studied by using three approaches: the potential, the asymptotic and the random order approach. In this study we analyze the axiomatic approach for one class of weight functions: the set of players is partitioned into a finite number of types, with each type having different weight.     

超图结构上合作博弈的赋权Position值

在合作博弈的一般模型中总是假设所有联盟都能形成。不过,在实际中由于受到一些因素的制约,有些联盟是不能形成的。基于此,Myerson提出了具有图通讯结构的合作博弈。Myerson值和Position值是超图博弈上的两个重要分配规则。2005年,Slikker给出了在图博弈上Position值的公理化刻画。但超图博弈上Position值的公理化刻画一直悬而未决。本文通过引入“赋权平衡超边贡献公理”,并结合经典的“分支有效性”,提出了超图博弈上赋权Position值的公理化刻画。作为推论,解决了超图博弈上Position值的公理化刻画问题。