On Critical Threshold Value for Simple Games

06/08/2018
by   Kanstantsin Pashkovich, et al.
0

In this note, we show that for every simple game with n players the critical threshold value is at most n/4. This verifies the conjecture of Fleixas and Kurz about critical threshold value of simple games.

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
07/12/2018

On the Approximation Resistance of Balanced Linear Threshold Functions

In this paper, we show that there exists a balanced linear threshold fun...
research
12/19/2021

A Short Proof of Convexity of Step-out Step-in Sequencing Games

The Step out-Step in sequencing game is a particular example of a game f...
research
07/13/2023

Entropic Risk for Turn-Based Stochastic Games

Entropic risk (ERisk) is an established risk measure in finance, quantif...
research
10/01/2017

The Crowdfunding Game

The recent success of crowdfunding for supporting new and innovative pro...
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
04/04/2020

Incentive compatibility in sender-receiver stopping games

We introduce a model of sender-receiver stopping games, where the state ...

Please sign up or login with your details

Forgot password? Click here to reset