On Critical Threshold Value for Simple Games
Computer Science and Game Theory
2018-06-12 v2
Authors:
Kanstantsin Pashkovich
Abstract
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 Freixas and Kurz.
Cite
@article{arxiv.1806.03170,
title = {On Critical Threshold Value for Simple Games},
author = {Kanstantsin Pashkovich},
journal= {arXiv preprint arXiv:1806.03170},
year = {2018}
}
Related papers
View all related →
Computer Science and Game Theory · Computer Science
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value
Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich +1
2020-04-08
Computer Science and Game Theory · Computer Science
Simple Games versus Weighted Voting Games
Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
2018-08-30
Combinatorics · Mathematics
On $\alpha$-roughly weighted games
Josep Freixas, Sascha Kurz
2012-11-20
Computer Science and Game Theory · Computer Science
Approximability and parameterized complexity of minmax values
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
2008-12-18
Computer Science and Game Theory · Computer Science
On Covering Codes and Upper Bounds for the Dimension of Simple Games
Martin Olsen
2016-09-19
Computer Science and Game Theory · Computer Science
The Nakamura numbers for computable simple games
Masahiro Kumabe, H. Reiju Mihara
2011-07-05
Probability · Mathematics
A Game of Random Variables
Artem Hulko, Mark Whitmeyer
2018-04-24
Computer Science and Game Theory · Computer Science
Characterization of threshold functions: state of the art, some new contributions and open problems
Josep Freixas, Marc Freixas, Sascha Kurz
2017-07-10
Combinatorics · Mathematics
Weighted and Roughly Weighted Simple Games
T. Gvozdeva, A. Slinko
2009-12-31
Computer Science and Game Theory · Computer Science
Growth of Dimension in Complete Simple Games
Liam O'Dwyer, Arkadii Slinko
2016-05-18
Combinatorics · Mathematics
The threshold bias of the clique-factor game
Anita Liebenau, Rajko Nenadov
2020-02-10
Computer Science and Game Theory · Computer Science
Player preferences in $N$-player games
Luc Edixhoven, Walter Kosters
2018-06-05
Computer Science and Game Theory · Computer Science
Approximating Values of Generalized-Reachability Stochastic Games
Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger +1
2021-02-02
Quantum Physics · Physics
Entangled games do not require much entanglement (withdrawn)
Gus Gutoski
2009-09-03
Computer Science and Game Theory · Computer Science
The Complexity of Testing Properties of Simple Games
Josep Freixas, Xavier Molinero, Martin Olsen, Maria Serna
2008-03-05
Combinatorics · Mathematics
The majority game with an arbitrary majority
John R. Britnell, Mark Wildon
2014-02-25
Computer Science and Game Theory · Computer Science
The complexity of solving reachability games using value and strategy iteration
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
2012-03-02
Optimization and Control · Mathematics
Mean Field Games of Controls with Boundary Conditions & Invariance Constraints
P. Jameson Graber, Kyle Rosengartner
2025-12-05
Quantum Physics · Physics
Two-player entangled games are NP-hard
Anand Natarajan, Thomas Vidick
2020-11-24
Theoretical Economics · Economics
With a little help from my friends: essentiality vs opportunity in group criticality
Michele Aleandri, Marco Dall'Aglio
2024-07-29
Combinatorics · Mathematics
The topology of competitively constructed graphs
Alan Frieze, Wesley Pegden
2014-01-23
Computer Science and Game Theory · Computer Science
On the Complexity of the Decisive Problem in Simple, Regular and Weighted Games
Andreas Polyméris, Fabián Riquelme
2013-07-10
Computer Science and Game Theory · Computer Science
Complexity of comparison of influence of players in simple games
Haris Aziz
2008-09-04
Computer Science and Game Theory · Computer Science
When Effort May Fail: Equilibria of Shared Effort with a Threshold
Gleb Polevoy, Stojan Trajanovski, Mathijs de Weerdt
2026-05-26
Computer Science and Game Theory · Computer Science
Computability of simple games: A complete investigation of the sixty-four possibilities
Masahiro Kumabe, H. Reiju Mihara
2011-07-05