Simple Games versus Weighted Voting Games

05/06/2018
by   Frits Hof, et al.
0

A simple game (N,v) is given by a set N of n players and a partition of 2^N into a set L of losing coalitions L with value v(L)=0 that is closed under taking subsets and a set W of winning coalitions W with v(W)=1. Simple games with α= _p≥ 0_W∈ W,L∈ Lp(L)/p(W)<1 are known as weighted voting games. Freixas and Kurz (IJGT, 2014) conjectured that α≤1/4n for every simple game (N,v). We confirm this conjecture for two complementary cases, namely when all minimal winning coalitions have size 3 and when no minimal winning coalition has size 3. As a general bound we prove that α≤2/7n for every simple game (N,v). For complete simple games, Freixas and Kurz conjectured that α=O(√(n)). We prove this conjecture up to a n factor. We also prove that for graphic simple games, that is, simple games in which every minimal winning coalition has size 2, computing α is -hard, but polynomial-time solvable if the underlying graph is bipartite. Moreover, we show that for every graphic simple game, deciding if α<a is polynomial-time solvable for every fixed a>0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2018

Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value

A simple game (N,v) is given by a set N of n players and a partition of ...
research
06/09/2020

A note on the growth of the dimension in complete simple games

The remoteness from a simple game to a weighted game can be measured by ...
research
01/19/2021

Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games

This paper is concerned with simple games. One of the fundamental questi...
research
04/23/2012

Solving Weighted Voting Game Design Problems Optimally: Representations, Synthesis, and Enumeration

We study the inverse power index problem for weighted voting games: the ...
research
12/01/2021

A note on simple games with two equivalence classes of players

Many real-world voting systems consist of voters that occur in just two ...
research
05/21/2020

A General Framework for Computing the Nucleolus Via Dynamic Programming

This paper defines a general class of cooperative games for which the nu...
research
05/30/2023

Hardness of Approximation in PSPACE and Separation Results for Pebble Games

We consider the pebble game on DAGs with bounded fan-in introduced in [P...

Please sign up or login with your details

Forgot password? Click here to reset