Displaying similar documents to “Amplitude of weighted majority game strict representations.”

On the complexity of problems on simple games

Josep Freixas, Xavier Molinero, Martin Olsen, Maria Serna (2011)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of games. This analysis as usual depends on the...

On the complexity of problems on simple games

Josep Freixas, Xavier Molinero, Martin Olsen, Maria Serna (2012)

RAIRO - Operations Research

Similarity:

Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of ...

Manipulation by Merging and Annexation in Weighted Voting Games

Slavov, Zdravko, Evans, Christina (2017)

Serdica Journal of Computing

Similarity:

The problem of manipulation in voting is fundamental and has received attention in recent research in game theory. In this paper, we consider two cases of manipulation in weighted voting games done by merging of coalitions into single players and by annexation of a part or all of the voting weights of another player viewed from two perspectives: of the effect of swings of players and of the role of the Banzhaf power index. We prove two theorems for manipulation by merging and annexation,...

Recognition rules in weighted majority games and their implications

Krzysztof Kasprzyk (2006)

Banach Center Publications

Similarity:

This paper examines implications of different random recognition rules used to select proposal-makers on the payoffs of players participating in a weighted majority game. In particular, incentives to strategically alter the set of players by strategic splits or mergers are investigated.

Delegation equilibrium payoffs in integer-splitting games

Sylvain Sorin, Cheng Wan (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This work studies a new strategic game called delegation game. A delegation game is associated to a basic game with a finite number of players where each player has a finite integer weight and her strategy consists in dividing it into several integer parts and assigning each part to one subset of finitely many facilities. In the associated delegation game, a player divides her weight into several integer parts, commits each part to an independent delegate and collects the sum of their...

Some values for constant-sum and bilateral cooperative games

Andrzej Młodak (2007)

Applicationes Mathematicae

Similarity:

We prove new axiomatizations of the Shapley value and the Banzhaf value, defined on the class of nonnegative constant-sum games with nonzero worth of the grand coalition as well as on nonnegative bilateral games with nonzero worth of the grand coalition. A characteristic feature of the latter class of cooperative games is that for such a game any coalition and its complement in the set of all players have the same worth. The axiomatizations are then generalized to the entire class of...

Analysis and improvement attempt of prof. Alan Fowler's negotiation game

Jakub Jan Golik (2018)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

The main goal of the following article is to design an improved version of the negotiation game created by prof. Alan Fowler (Fowler, 1997). I have tried to achieve this by constructing four separate versions of the game which represent different approaches while preserving rules, chosen basic technical assumptions and the simplicity of the base game. Each version of the game is supposed to i.a. make it less obvious, create new negotiation possibilities (including potential cooperation),...

An axiomatization of the aspiration core

Hans Keiding (2006)

Banach Center Publications

Similarity:

The aspiration core of a TU game was introduced by Bennett [1] as a payoff vector which is undominated and achievable in the sense that each player belongs to a coalition which can obtain the specified payoff for its members, and which minimizes the distance to the set of aggregate feasible payoffs among all such payoff vectors. In the paper a set of axioms is proposed which characterize the aspiration core, which may be considered as an extension of the core to a much larger set of...