We present new axiomatic characterizations of the proportional Shapley value, a weighted TU-value with the worths of the singletons as weights. The presented characterizations are proportional counterparts to the famous characterizations of the Shapley value by Shapley and Young. We introduce two new axioms, called proportionality and player splitting, respectively. Each of them makes a main difference between the proportional Shapley value and the Shapley value. If the stand-alone worths are (...) plausible weights, the proportional Shapley value is a convincing alternative to the Shapley value, for example in cost allocation. Especially, the player splitting property, which states that players’ payoffs do not change if another player splits into two new players who have the same impact to the game as the original player, justifies the use of the proportional Shapley value in many economic situations. (shrink)

The ancient problems of bankruptcy, contested garment, and rights arbitration have generated many studies, debates, and controversy. The objective of this paper is to show that the Shapley value from game theory, measuring the power of each player in a game, may be consistently applied for getting the general one-step solution of all these three problems viewed as -person games. The decision making is based on the same tool, namely the game theory logic based on the use of (...) the Shapley value, but the specific games involved are slightly different in each problem. The kind of claims of the players, the relationship between the given claims and the given resources available, and the particular way of calculating the generalized characteristic function of the game determine the specific type of game which has to be solved in each of the three ancient problems mentioned. The iterative use of the Shapley value may also justify the well-known Aumann-Maschler step-by-step procedure for solving the bankruptcy problem. (shrink)

The family of discounted Shapley values is analyzed for cooperative games in coalitional form. We consider the bargaining protocol of the alternating random proposer introduced in Hart and Mas-Colell. We demonstrate that the discounted Shapley values arise as the expected payoffs associated with the bargaining equilibria when a time discount factor is considered. In a second model, we replace the time cost with the probability that the game ends without agreements. This model also implements these values in transferable (...) utility games, moreover, the model implements the α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}-consistent values in the nontransferable utility setting. (shrink)

We consider an implementation of the discounted Shapley value. We modify the Hart–Mas-Colell model such that each player discounts future payoffs and proposes not only an allocation, but also a coalition. We show that the discounted Shapley value is supported by each stationary subgame perfect equilibrium of the modified game such that in each subgame, the coalition that consists of all active players immediately forms. We also provide conditions for such a stationary subgame perfect equilibrium to (...) exist. (shrink)

We revisit the characterization of the Shapley value by van den Brink (Int J Game Theory, 2001, 30:309–319) via efficiency, the Null player axiom, and some fairness axiom. In particular, we show that this characterization also works within certain classes of TU games, including the classes of superadditive and of convex games. Further, we advocate some differential version of the marginality axiom (Young, Int J Game Theory, 1985, 14: 65–72), which turns out to be equivalent to the van (...) den Brink fairness axiom on large classes of games. (shrink)

The purpose of this paper is to develop an approach to multiattribute group decision making under interval-valued hesitant fuzzy environment. To do this, this paper defines some new operations on interval-valued hesitant fuzzy elements, which eliminate the disadvantages of the existing operations. Considering the fact that elements in a set may be interdependent, two generalized interval-valued hesitant fuzzy operators based on the generalized Shapley function and the Choquet integral are defined. Then, some models for calculating the optimal fuzzy measures (...) on the expert set and the ordered position set are established. Because fuzzy measures are defined on the power set, it makes the problem exponentially complex. To simplify the complexity of solving a fuzzy measure, models for the optimal 2-additive measures are constructed. Finally, an investment problem is offered to show the practicality and efficiency of the new method. (shrink)

In cooperative game theory with transferable utilities, there are two well-established ways of redistributing Shapley value payoffs: using egalitarian Shapley values, and using consensus values. We present parallel characterizations of these classes of solutions. Together with the axioms that characterize the original Shapley value, those that specify the redistribution methods characterize the two classes of values. For the class of egalitarian Shapley values, we focus on redistributions in one-person unanimity games from two perspectives: allowing (...) the worth of coalitions to vary, while keeping the player set fixed; and allowing the player set to change, while keeping the worth of coalitions fixed. This class of values is characterized by efficiency, the balanced contributions property for equal contributors, weak covariance, a proportionately decreasing redistribution in one-person unanimity games, desirability, and null players in unanimity games. For the class of consensus values, we concentrate on redistributions in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document}-person unanimity games from the same two perspectives. This class of values is characterized by efficiency, the balanced contributions property for equal contributors to social surplus, complement weak covariance, a proportionately decreasing redistribution in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document}-person unanimity games, desirability, and null players in unanimity games. (shrink)

This article proposes three new decompositions of inequality measures, drawn from the framework of cooperative game theory. It allows the impact of players’ interactions, rather than players’ contributions to inequality, to be taken into consideration. These innovative approaches are especially suited for the study of income inequality when the income has a hierarchical structure: the income is composed of several primary sources, with the particularity that each of them is also composed of secondary sources. We revisit the Shapley–Owen (...) class='Hi'>value that quantifies the importance of each of these secondary sources in the overall income inequality. Our main contribution is to decompose this importance into two parts: the pure marginal contribution of the considered source and a weighted sum of pairwise interactions. We then provide an axiomatic characterization of each additive interaction decomposable (AID) coalitional value considered in this paper. We give an application of these decompositions in the context of inequality theory. (shrink)

In sub-Sect. 3.3, the terms “one-person” and “-person” were incorrectly updated by mistake during the correction stage in the online published article.

The aim of cooperative game theory is to suggest and defend payoffs for the players that depend on a coalition function (characteristic function) describing the economic, social, or political situation. We consider situations where the payoffs for some players are determined exogenously. For example, in many countries, lawyers or real-estate agents obtain a regulated fee or a regulated percentage of the business involved. The aim of this article is to suggest and axiomatize two values with exogenous payments, an unweighted one (...) and a weighted one. (shrink)

The Shapley value is a well-known solution concept for TU games. The Maschler–Owen value and the NTU Shapley value are two well-known extensions of the Shapley value to NTU games. A hyperplane game is an NTU game in which the feasible set for each coalition is a hyperplane. On the domain of monotonic hyperplane games, the Maschler–Owen value is axiomatized. Although the domain of hyperplane game is a very interesting class of games (...) to study, unfortunately, on this domain, the NTU Shapley value is not well-defined, namely, it assigns an empty set to some hyperplane games. A prize game is an NTU game that can be obtained by “truncating” a hyperplane game. As such, a prize game describes essentially the same situation as the corresponding hyperplane game. It turns out that, on the domain of monotonic prize games, the NTU Shapley value is well-defined. Thus, one can define a value which is well-defined on the domain of monotonic hyperplane games as follows: given a monotonic hyperplane game, first, transform it into a prize game, and then apply the NTU Shapley value to it. We refer to the resulting value as the “generalized Shapley value” and compare the axiomatic properties of it with those of the Maschler–Owen value on the union of the class of monotonic hyperplane games and that of monotonic prize games. We also provide axiomatizations of the Maschler–Owen value and the generalized Shapley value on that domain. (shrink)

In this paper we study three-valued simple games as a natural extension of simple games. We analyze to which extent well-known results on the core and the Shapley value for simple games can be extended to this new setting. To describe the core of a three-valued simple game we introduce vital players, in analogy to veto players for simple games. Moreover, it is seen that the transfer property of Dubey can still be used to characterize the Shapley (...) value for three-valued simple games. We illustrate three-valued simple games and the corresponding Shapley value in a parliamentary bicameral system. (shrink)

Three values for non-transferable utility games -- the Harsanyi NTU-value, the Shapley NTU-value, and the Maschler--Owen consistent NTU-value -- are compared in a simple example.

The Shapley value is the unique value defined on the class of cooperative games in characteristic function form which satisfies certain intuitively reasonable axioms. Alternatively, the Banzhaf value is the unique value satisfying a different set of axioms. The main drawback of the latter value is that it does not satisfy the efficiency axiom, so that the sum of the values assigned to the players does not need to be equal to the worth of (...) the grand coalition. By definition, the normalized Banzhaf value satisfies the efficiency axiom, but not the usual axiom of additivity. (shrink)

We introduce a solution concept for cooperative games with transferable utility and a coalition structure that is proportional for two-player games. Our value is obtained from generalizing a proportional value for cooperative games with transferable utility in a way that parallels the extension of the Shapley value to the Owen value. We provide two characterizations of our solution concept, one that employs a property that can be seen as the proportional analog to Myerson’s balanced contribution (...) property; and a second one that relies on a consistency property. (shrink)

The model of incomplete cooperative games incorporates uncertainty into the classical model of cooperative games by considering a partial characteristic function. Thus the values for some of the coalitions are not known. The main focus of this paper is 1-convexity under this framework. We are interested in two heavily intertwined questions. First, given an incomplete game, how can we fill in the missing values to obtain a complete 1-convex game? Second, how to determine in a rational, fair, and efficient way (...) the payoffs of players based only on the known values of coalitions? We illustrate the analysis with two classes of incomplete games—minimal incomplete games and incomplete games with defined upper vector. To answer the first question, for both classes, we provide a description of the set of 1-convex extensions in terms of its extreme points and extreme rays. Based on the description of the set of 1-convex extensions, we introduce generalisations of three solution concepts for complete games, namely the τ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}-value, the Shapley value and the nucleolus. For minimal incomplete games, we show that all of the generalised values coincide. We call it the average value and provide different axiomatisations. For incomplete games with defined upper vector, we show that the generalised values do not coincide in general. This highlights the importance and also the difficulty of considering more general classes of incomplete games. (shrink)

A new class of values combining marginalistic and egalitarian principles is introduced for cooperative TU-games. It includes some modes of solidarity among the players by taking the collective contribution of some coalitions to the grand coalition into account. Relationships with other class of values such as the Egalitarian Shapley values and the Procedural values are discussed. We propose a strategic implementation of our class of values in subgame perfect Nash equilibrium. Two axiomatic characterizations are provided: one of the whole (...) class of values, and one of each of its extreme points. (shrink)

The principle of differential marginality (Casajus in Theory and Decis 71(2):163-–174) for cooperative games is a very appealing property that requires equal productivity differentials to translate into equal payoff differentials. In this paper we apply this property to axiomatic characterizations of values. We show that differential marginality implies additivity and symmetry under certain conditions. Based on this result, we propose new characterizations of the equal division and the equal surplus division values. Finally, we characterize two classes of convex combinations of (...) values, i.e., α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}-egalitarian Shapley values and α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}-equal surplus division values, by employing differential marginality and establishing the uniqueness of these values on inessential games. (shrink)

The Choquet expected utility model deals with nonadditive probabilities (or capacities). Their dependence on the information the decision-maker has about the possibility of the events is taken into account. Two kinds of information are examined: interval information (for instance, the percentage of white balls in an urn is between 60% and 100%) and comparative information (for instance, the information that there are more white balls than black ones). Some implications are shown with regard to the core of the capacity and (...) to two additive measures which can be derived from capacities: the Shapley value and the nucleolus. Interval information bounds prove to be satisfied by all probabilities in the core, but they are not necessarily satisfied by the nucleolus (when the core is empty) and the Shapley value. We must introduce the constrained nucleolus in order for these bounds to be satisfied, while the Shapley value does not seem to be adjustable. On the contrary, comparative information inequalities prove to be not necessarily satisfied by all probabilities in the core and we must introduce the constrained core in order for these inequalities be satisfied. However, both the nucleolus and the Shapley value satisfy the comparative information inequalities, and the Shapley value does it more strictly than the nucleolus. (shrink)

A community faces the obligation of providing an indivisible public good that each of its members is able to provide at a certain cost. The solution is to rely on the member who can provide the public good at the lowest cost, with a due compensation from the other members. This problem has been studied in a non-cooperative setting by Kleindorfer and Sertel. They propose an auction mechanism that results in an interval of possible individual contributions whose lower bound is (...) the equal division. Here, instead we take a cooperative stand point by modelling this problem as a cost sharing game that turns out to be a ‘reverse’ airport game whose core is shown to have a regular structure. This enables an easy calculation of the nucleolus that happens to define the upper bound of the Kleindorfer–Sertel interval. The Shapley value instead is not an appropriate solution in this context because it may imply compensations to non-providers. (shrink)

Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficiently compute solution concepts assuming such representations. Marginal contribution nets , introduced by Ieong and Shoham, are one of the simplest and most influential representation schemes for coalitional games. MC-nets are a rulebased formalism, in which rules take the form pattern → value, where “pattern ” is a Boolean condition over (...) agents, and “value ” is a numeric value. Ieong and Shoham showed that, for a class of what we will call “basic” MC-nets, where patterns are constrained to be a conjunction of literals, marginal contribution nets permit the easy computation of solution concepts such as the Shapley value. However, there are very natural classes of coalitional games that require an exponential number of such basic MC-net rules. We present read-once MC-nets, a new class of MC-nets that is provably more compact than basic MC-nets, while retaining the attractive computational properties of basic MC-nets. We show how the techniques we develop for read-once MC-nets can be applied to other domains, in particular, computing solution concepts in network flow games on series-parallel networks. (shrink)

This article constructs a static model of information acquisition when the agent does not know exactly what pieces of information he is missing. A representation of preferences over information channels and menus of lotteries is shown by adapting the model of unforeseen contingencies by Dekel et al. (Econometrica 69:891–934, 2001; Econometrica 75:591–600, 2007), which is an extension of Kreps (Econometrica 47:565–576, 1979; Economic analysis of markets and games: essays in honor of Frank Hahn, 1992). Also, characterisation of informativeness of an (...) information channel analogous to the one by Blackwell (Ann Math Stud 24:265–272, 1953) is examined in conjunction with the preference for flexibility by applying the structure of Shapley value. (shrink)

Digraph games are cooperative TU-games associated to domination structures which can be modeled by directed graphs. Examples come from sports competitions or from simple majority win digraphs corresponding to preference profiles in social choice theory. The Shapley value, core, marginal vectors and selectope vectors of digraph games are characterized in terms of so-called simple score vectors. A general characterization of the class of (almost positive) TU-games where each selectope vector is a marginal vector is provided in terms of (...) game semi-circuits. Finally, applications to the ranking of teams in sports competitions and of alternatives in social choice theory are discussed. (shrink)

It is known that peer group games are a special class of games with a permission structure. However, peer group games are also a special class of digraph games. To be specific, they are digraph games in which the digraph is the transitive closure of a rooted tree. In this paper we first argue that some known results on solutions for peer group games hold more general for digraph games. Second, we generalize both digraph games as well as games with (...) a permission structure into a model called games with a local permission structure, where every player needs permission from its predecessors only to generate worth, but does not need its predecessors to give permission to its own successors. We introduce and axiomatize a Shapley value-type solution for these games, generalizing the conjunctive permission value for games with a permission structure and the β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document}-measure for weighted digraphs. (shrink)

The paper extends a result in Dutta and Ray's (1989) theory of constrained egalitarianism initiated by relying on the concept of proportionate rather than absolute equality. We apply this framework to redistributive systems in which what the individuals get depends on what they receive or pay qua members of generally overlapping groups. We solve the constrained equalization problem for this class of models. The paper ends up comparing our solution with the alternative solution based on the Shapley value, (...) which has been recommended in some distributive applications. (shrink)

The main purpose of this article is to introduce the weighted ENSC value for cooperative transferable utility games which takes into account players’ selfishness about the payoff allocations. Similar to Shapley’s idea of a one-by-one formation of the grand coalition [Shapley ], we first provide a procedural implementation of the weighted ENSC value depending on players’ selfishness as well as their marginal contributions to the grand coalition. Second, in the spirit of the nucleolus [Schmeidler ], we (...) prove that the weighted ENSC value is obtained by lexicographically minimizing a complaint vector associated with a new complaint criterion relying on players’ selfishness. (shrink)

Abstract. Few American scientists have devoted as much attention to religion and science as Harvard geologist Kirtley Fletcher Mather (1888–1978). Responding to antievolutionism during the 1920s, he taught Sunday School classes, assisted in defending John Scopes, and wrote Science in Search of God (1928). Over the next 40 years, Mather explored the place of humanity in the universe and the presence of values in light of what he often called “the administration of the universe,” a term and concept he borrowed (...) from his former teacher, geologist Thomas Chrowder Chamberlin. Human values, including cooperation and altruism, had emerged in such a context: “the administrative directive toward orderly organization of increasingly complex systems transcends the urge for survival.” He was also active in the early years of the Institute on Religion in an Age of Science, an organization created by his good friends Ralph Wendell Burhoe and Harlow Shapley. (shrink)

A path scheme for a game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path. A path scheme is called population monotonic if a player’s payoff does not decrease as the path coalition grows. In this study, we focus on Shapley path schemes of simple games in which for every path coalition the Shapley value of (...) the associated subgame provides the allocation at hand. Obviously, each Shapley path scheme of a game is population monotonic if and only if the Shapley allocation scheme of the game is population monotonic in the sense of Sprumont (Games Econ Behav 2:378–394, 1990). We prove that a simple game allows for population monotonic Shapley path schemes if and only if the game is balanced. Moreover, the Shapley path scheme of a specific path is population monotonic if and only if the first winning coalition that is formed along the path contains every minimal winning coalition. We also show that each Shapley path scheme of a simple game is population monotonic if and only if the set of veto players of the game is a winning coalition. Extensions of these results to other efficient probabilistic values are discussed. (shrink)

A symmetric network consists of a set of positions and a set of bilateral links between these positions. For every symmetric network we define a cooperative transferable utility game that measures the “power” of each coalition of positions in the network. Applying the Shapley value to this game yields a network power measure, the β-measure, which reflects the power of the individual positions in the network. Applying this power distribution method iteratively yields a limit distribution, which turns out (...) to be proportional to the well-known degree measure. We compare the β-measure and degree measure by providing characterizations, which differ only in the normalization that is used. (shrink)

The Fairness, Accountability, and Transparency (FAccT) literature tends to focus on bias as a problem that requires ex post solutions (e.g. fairness metrics), rather than addressing the underlying social and technical conditions that (re)produce it. In this article, we propose a complementary strategy that uses genealogy as a constructive, epistemic critique to explain algorithmic bias in terms of the conditions that enable it. We focus on XAI feature attributions (Shapley values) and counterfactual approaches as potential tools to gauge these (...) conditions and offer two main contributions. One is constructive: we develop a theoretical framework to classify these approaches according to their relevance for bias as evidence of social disparities. We draw on Pearl’s ladder of causation (Causality: models, reasoning, and inference. Cambridge University Press, Cambridge, 2000, Causality, 2nd edn. Cambridge University Press, Cambridge, 2009. doi:10.1017/CBO9780511803161) to order these XAI approaches concerning their ability to answer fairness-relevant questions and identify fairness-relevant solutions. The other contribution is critical: we evaluate these approaches in terms of their assumptions about the role of protected characteristics in discriminatory outcomes. We achieve this by building on Kohler-Hausmann’s (Northwest Univ Law Rev 113(5):1163–1227, 2019) constructivist theory of discrimination. We derive three recommendations for XAI practitioners to develop and AI policymakers to regulate tools that address algorithmic bias in its conditions and hence mitigate its future occurrence. (shrink)

During a cultural festival, artists and theaters act as a cartel by agreeing on pricing decisions that maximize the groups’ profit as a whole. We model the problem of sharing the profit created by a festival among organizing theaters as a cooperative game. In such a game, the worth of a coalition is defined as the theaters’ profit from the optimal fixation of prices. We show that this class of games is convex and we axiomatically characterize the Shapley (...) class='Hi'>value for this class of games. We also provide an axiomatic basis for the downstream incremental solution. Finally, we apply this model to the NEXT festival, for which we have collected data. We propose an approach to derive the games’ vector from the data and we compute the different solutions. (shrink)

A cooperative game with transferable utility–or simply a TU-game– describes a situation in which players can obtain certain payoffs by cooperation. A value function for these games assigns to every TU-game a distribution of payoffs over the players. Well-known solutions for TU-games are the Shapley and the Banzhaf value. An alternative type of solution is the concept of share function, which assigns to every player in a TU-game its share in the worth of the grand coalition. In (...) this paper we consider TU-games in which the players are organized into a coalition structure being a finite partition of the set of players. The Shapley value has been generalized by Owen to TU-games in coalition structure. We redefine this value function as a share function and show that this solution satisfies the multiplication property that the share of a player in some coalition is equal to the product of the Shapley share of the coalition in a game between the coalitions and the Shapley share of the player in a game between the players within the coalition. Analogously we introduce a Banzhaf coalition structure share function. Application of these share functions to simple majority games show some appealing properties. (shrink)

We introduce a new class of values for TU-games with a level structure, called LS-games. A level structure is a hierarchical structure where each level corresponds to a partition of the player set, which becomes increasingly coarse from the trivial partition containing only singletons to the partition containing only the grand coalition. The new values, called Harsanyi support levels solutions, extend the Harsanyi solutions for LS-games. As an important subset of the class of these values, we present the class of (...) weighted Shapley support levels values as a further result. The values from this class extend the weighted Shapley values for LS-games and contain the Shapley levels value as a special case. Axiomatizations of the studied classes are provided. (shrink)

A symmetric network consists of a set of positions and a set of bilateral links between these positions. For every symmetric network we define a cooperative transferable utility game that measures the “power” of each coalition of positions in the network. Applying the Shapley value to this game yields a network power measure, the β-measure, which reflects the power of the individual positions in the network. Applying this power distribution method iteratively yields a limit distribution, which turns out (...) to be proportional to the well-known degree measure. We compare the β-measure and degree measure by providing characterizations, which differ only in the normalization that is used. (shrink)

Jazz band is a 3 player superadditive game in characteristic function form. Three players have to divide the payoff they can get, while being in a grand coalition, provided their individual and duo coalitions payoffs are known. Assumptions of individual and collective rationality lead to the notion of the core of the game. We discuss offers that cannot readily be refused [OCRR] as the solutions of the game in case of an empty core, when duo coalitions are the best options (...) but only for two out of three players. The experiment shows that even in case of an empty core the most probable results are three-way coalitions and the share of the weakest player usually exceeds his OCRR. The Shapley value is introduced and its fairness is discussed as it lies at the side of the core while, on the other hand, the nucleolus lies exactly at the center of the core. We conclude that, in spite of that, the Shapley value is the best candidate for a fair sharing solution of the jazz band game and other similar games as, opposite to the other values, it is dependent both on individual and duo coalitions payoffs. (shrink)

Digraph games are cooperative TU-games associated to domination structures which can be modeled by directed graphs. Examples come from sports competitions or from simple majority win digraphs corresponding to preference profiles in social choice theory. The Shapley value, core, marginal vectors and selectope vectors of digraph games are characterized in terms of so-called simple score vectors. A general characterization of the class of (almost positive) TU-games where each selectope vector is a marginal vector is provided in terms of (...) game semi-circuits. Finally, applications to the ranking of teams in sports competitions and of alternatives in social choice theory are discussed. (shrink)

If K is an index of relative voting power for simple voting games, the bicameral postulate requires that the distribution of K -power within a voting assembly, as measured by the ratios of the powers of the voters, be independent of whether the assembly is viewed as a separate legislature or as one chamber of a bicameral system, provided that there are no voters common to both chambers. We argue that a reasonable index – if it is to be used (...) as a tool for analysing abstract, ‘uninhabited’ decision rules – should satisfy this postulate. We show that, among known indices, only the Banzhaf measure does so. Moreover, the Shapley–Shubik, Deegan–Packel and Johnston indices sometimes witness a reversal under these circumstances, with voter x ‘less powerful’ than y when measured in the simple voting game G1 , but ‘more powerful’ than y when G1 is ‘bicamerally joined’ with a second chamber G2 . Thus these three indices violate a weaker, and correspondingly more compelling, form of the bicameral postulate. It is also shown that these indices are not always co-monotonic with the Banzhaf index and that as a result they infringe another intuitively plausible condition – the price monotonicity condition. We discuss implications of these findings, in light of recent work showing that only the Shapley–Shubik index, among known measures, satisfies another compelling principle known as the bloc postulate. We also propose a distinction between two separate aspects of voting power: power as share in a fixed purse (P-power) and power as influence (I-power). (shrink)

The desirability relation was introduced by Isbell to qualitatively compare the a priori influence of voters in a simple game. In this paper, we extend this desirability relation to simple games with coalition structure. In these games, players organize themselves into a priori disjoint coalitions. It appears that the desirability relation defined in this paper is a complete preorder in the class of swap-robust games. We also compare our desirability relation with the preorders induced by the generalizations to games with (...) coalition structure of the Shapley–Shubik and Banzhaf–Coleman power indices Values of games with a priori unions, 1977; Owen, Power, voting and voting power. In: Holler MJ Modification of the Banzhaf–Coleman index for games with a priori unions, 1981). It happens that in general they are different even if one considers the subclass of weighed voting games. However, if structural coalitions have equal size then both Owen–Banzhaf and the desirability preordering coincide. (shrink)

L S Penrose’s Limit Theorem – which is implicit in Penrose [7, p. 72] and for which he gave no rigorous proof – says that, in simple weighted voting games, if the number of voters increases indefinitely and the relative quota is pegged, then – under certain conditions – the ratio between the voting powers of any two voters converges to the ratio between their weights. Lindner and Machover [4] prove some special cases of Penrose’s Limit Theorem. They give a (...) simple counter-example showing that the theorem does not hold in general even under the conditions assumed by Penrose; but they conjecture, in effect, that under rather general conditions it holds ‘almost always’ – that is with probability 1 – for large classes of weighted voting games, for various values of the quota, and with respect to several measures of voting power. We use simulation to test this conjecture. It is corroborated with respect to the Penrose–Banzhaf index for a quota of 50% but not for other values; with respect to the Shapley–Shubik index the conjecture is corroborated for all values of the quota. (shrink)

This paper constructs a predictive model of student reading literacy based on data from students who participated in the Program for International Student Assessment from four provinces/municipalities of China, i.e., Beijing, Shanghai, Jiangsu and Zhejiang. We calculated the contribution of influencing factors in the model by using eXtreme Gradient Boosting algorithm and sHapley additive exPlanations values, and get the following findings: Factors that have the greatest impact on students’ reading literacy are from individual and family levels, with school-level factors (...) taking a relative back seat. The most important influencing factors at individual level are reading metacognition and reading interest. The most important factors at family level are ESCS and language environment, and dialect is negative for reading literacy, whereas proficiency in both a dialect and Mandarin plays a positive role. At the school level, the most important factors are time dedicated to learning and class discipline, and we found that there is an optimal value for learning time, which suggests that reasonable learning time is beneficial, but overextended learning time may make academic performance worse instead of improving it. (shrink)