Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output

The Shapley-Shubik index is a specialization of the Shapley value and is widely applied to evaluate the power distribution in committees drawing binary decisions. It was generalized to decisions with more than two levels of approval both in the input and the output. The corresponding games are called $(j,k)$ simple games. Here we present a new axiomatization for the Shapley-Shubik index for $(j,k)$ simple games as well as for a continuous variant, which may be considered as the limit case.Comment: 25 page

The Public Good index for games with several levels of approval in the input and output

The Public Good index is a power index for simple games introduced by Holler and later axiomatized by Holler and Packel, so that some authors also speak of the Holler--Packel index. A generalization to the class of games with transferable utility was given by Holler and Li. Here we generalize the underlying ideas to games with several levels of approval in the input and output -- so-called $(j,k)$ simple games. Corresponding axiomatizations are also provided.Comment: 16 page

Bisemivalues for bicooperative games

We introduce bisemivalues for bicooperative games and we also provide an interesting characterization of this kind of values by means of weighting coefficients in a similar way as it was given for semivalues in the context of cooperative games. Moreover, the notion of induced bisemivalues on lower cardinalities also makes sense and an adaptation of Dragan’s recurrence formula is obtained. For the particular case of (p, q)-bisemivalues, a computational procedure in terms of the multilinear extension of the game is given.Peer ReviewedPostprint (author's final draft

Achievable hierarchies in voting games with abstention

It is well known that he influence relation orders the voters the same way as the classical Banzhaf and Shapley-Shubik indices do when they are extended to the voting games with abstention (VGA) in the class of complete games. Moreover, all hierarchies for the influence relation are achievable in the class of complete VGA. The aim of this paper is twofold. Firstly, we show that all hierarchies are achievable in a subclass of weighted VGA, the class of weighted games for which a single weight is assigned to voters. Secondly, we conduct a partial study of achievable hierarchies within the subclass of H-complete games, that is, complete games under stronger versions of influence relation. (C) 2013 Elsevier B.V. All rights reserved.Peer ReviewedPostprint (author’s final draft

Generalized roll-call model for the Shapley-Shubik index

In 1996 Dan Felsenthal and Mosh\'e Machover considered the following model. An assembly consisting of $n$ voters exercises roll-call. All $n!$ possible orders in which the voters may be called are assumed to be equiprobable. The votes of each voter are independent with expectation $0<p<1$ for an individual vote {\lq\lq}yea{\rq\rq}. For a given decision rule $v$ the \emph{pivotal} voter in a roll-call is the one whose vote finally decides the aggregated outcome. It turned out that the probability to be pivotal is equivalent to the Shapley-Shubik index. Here we give an easy combinatorial proof of this coincidence, further weaken the assumptions of the underlying model, and study generalizations to the case of more than two alternatives.Comment: 19 pages; we added a reference to an earlier proof of our main resul

Measuring Power and Satisfaction in Societies with Opinion Leaders: Dictator and Opinion Leader Properties

A well known and established model in communication policy in sociology and marketing is that of opinion leadership. Opinion leaders are actors in a society who are able to affect the behavior of other members of the society called followers. Hence, opinion leaders might have a considerable impact on the behavior of markets and other social agglomerations being made up of individual actors choosing among a number of alternatives. For marketing or policy purposes it appears to be interesting to investigate the effect of different opinion leader-follower structures in markets or any other collective decision-making situations in a society. We study a two-action model in which the members of a society are to choose one action, for instance, to buy or not to buy a certain joint product, or to vote yes or no on a specific proposal. Each of the actors has an inclination to choose one of the actions. By definition opinion leaders have some power over their followers, and they exercise this power by influencing the behavior of their followers, i.e. their choice of action. After all actors have chosen their actions, a decision-making mechanism determines the collective choice resulting out of the individual choices. Making use of bipartite digraphs we introduce novel satisfaction and power scores which allow us to analyze the actors' satisfaction and power with respect to the collective choice for societies with different opinion leader-follower structures. Moreover, we study common dictator and opinion leader properties of the above scores and illustrate our findings for a society with five members.Bipartite digraph ; influence ; inclination ; collective choice ; opinion leader ; follower ; satisfaction ; power ; dictator properties ; opinion leader properties

Influence functions, followers and command games

We study and compare two frameworks: a model of influence, and command games. In the influence model, in which players are to make a certain acceptance/rejection decision, due to influence of other players, the decision of a player may be different from his inclination. We study a relation between two central concepts of this model: influence function, and follower function. We deliver sufficient and necessary conditions for a function to be a follower function, and we describe the structure of the set of all influence functions that lead to a given follower function. In the command structure introduced by Hu and Shapley, for each player a simple game called the command game is built. One of the central concepts of this model is the concept of command function. We deliver sufficient and necessary conditions for a function to be a command function,and describe the minimal sets generating a normal command game. We also study the relation between command games and influence functions. A sufficient and necessary condition for the equivalence between an influence function and a normal command game is delivered.influence function, follower function, lower and upper inverses, kernel, command game, command function, minimal sets generating a command game

A model of influence with an ordered set of possible actions

In the paper, a yes-no model of influence is generalized to a multi-choice framework. We introduce and study weighted influence indices of a coalition on a player in a social network, where players have an ordered set of possible actions. Each player has an inclination to choose one of the actions. Due to mutual influence among players, the final decision of each player may be different from his original inclination. In a particular case, the decision of the player is closer to the inclination of the influencing coalition than his inclination was, i.e., the distance between the inclinations of the player and of the coalition is greater than the distance between the decision of the player and the inclination of the coalition in question. The weighted influence index which captures such a case is called the weighted positive influence index. We also consider the weighted negative influence index, where the final decision of the player goes farther away from the inclination of the coalition. We consider several influence functions defined in the generalized model of influence and study their properties. The concept of a follower of a given coalition, and its particular case, a perfect follower, are defined. The properties of the set of followers are analyzed.weighted positive influence index; weighted negative influence index; influence function; follower of a coalition; perfect follower; kernel