A note on the complexity of integer programming games
Computational Complexity
2019-07-30 v2 Computer Science and Game Theory
Authors:
Margarida Carvalho
Abstract
In this brief note, we prove that the existence of Nash equilibria on integer programming games is Σ2p-complete.
Keywords
Cite
@article{arxiv.1907.11338,
title = {A note on the complexity of integer programming games},
author = {Margarida Carvalho},
journal= {arXiv preprint arXiv:1907.11338},
year = {2019}
}
Related papers
View all related →
Computer Science and Game Theory · Computer Science
Computing Nash equilibria for integer programming games
Margarida Carvalho, Andrea Lodi, João Pedro Pedroso
2023-04-25
Optimization and Control · Mathematics
Nash-equilibria and N-fold integer programming
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2009-03-27
Optimization and Control · Mathematics
Integer Programming Games: A Gentle Computational Overview
Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan
2023-06-13
Computer Science and Game Theory · Computer Science
The Exact Computational Complexity of Evolutionarily Stable Strategies
Vincent Conitzer
2018-05-08
Optimization and Control · Mathematics
Computing Approximate Nash Equilibria for Integer Programming Games
Aloïs Duguet, Margarida Carvalho, Gabriele Dragotto, Sandra Ulrich Ngueveu
2025-08-04
Computer Science and Game Theory · Computer Science
Time Complexity Analysis of an Evolutionary Algorithm for approximating Nash Equilibriums
Aadesh Salecha
2021-10-27
Computer Science and Game Theory · Computer Science
Some Algebraic Properties of a Subclass of Finite Normal Form Games
Samaresh Chatterji, Ratnik Gandhi
2010-01-28
Computational Complexity · Computer Science
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games
Vittorio Bilò, Marios Mavronicolas
2019-07-25
Computer Science and Game Theory · Computer Science
On the Computational Complexity of Decision Problems about Multi-Player Nash Equilibria
Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen
2020-01-16
Computer Science and Game Theory · Computer Science
On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
Kristoffer Arnsfelt Hansen, Xinhao Nie
2025-10-14
Computer Science and Game Theory · Computer Science
Pure Nash Equilibria: Hard and Easy Games
G. Gottlob, G. Greco, F. Scarcello
2013-07-19
Computer Science and Game Theory · Computer Science
Smooth Nash Equilibria: Algorithms and Complexity
Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, Abhishek Shetty
2024-07-23
Computer Science and Game Theory · Computer Science
The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan
2025-10-21
Computer Science and Game Theory · Computer Science
A survey on algorithms for Nash equilibria in finite normal-form games
Hanyu Li, Wenhan Huang, Zhijian Duan, David Henry Mguni +3
2023-12-19
Computer Science and Game Theory · Computer Science
Extending Finite Memory Determinacy to Multiplayer Games
Stéphane Le Roux, Arno Pauly
2017-01-03
Computer Science and Game Theory · Computer Science
On the Verification and Computation of Strong Nash Equilibrium
Nicola Gatti, Marco Rocco, Tuomas Sandholm
2017-11-20
Computer Science and Game Theory · Computer Science
Nash Equilibria in Symmetric Games with Partial Observation
Patricia Bouyer, Nicolas Markey, Steen Vester
2014-04-04
Computer Science and Game Theory · Computer Science
A partial proof of Nash's Theorem via exchangeable equilibria
Noah D. Stein, Pablo A. Parrilo, Asuman Ozdaglar
2010-09-14
Computer Science and Game Theory · Computer Science
Inapproximability of Nash Equilibrium
Aviad Rubinstein
2016-09-14
Computer Science and Game Theory · Computer Science
NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Games
Takashi Ishizuka, Naoyuki Kamiyama
2022-08-23
Computer Science and Game Theory · Computer Science
Fast Complete Algorithm for Multiplayer Nash Equilibrium
Sam Ganzfried
2023-01-18
Computer Science and Game Theory · Computer Science
Scheduling Games with Machine-Dependent Priority Lists
Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir
2023-11-28
Computer Science and Game Theory · Computer Science
Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria
Gianluigi Greco, Francesco Scarcello
2012-07-09
Computer Science and Game Theory · Computer Science
A simple and numerically stable primal-dual algorithm for computing Nash-equilibria in sequential games with incomplete information
Elvis Dohmatob
2015-12-24
Computational Complexity · Computer Science
The Computational Complexity of Equilibria with Strategic Constraints
Bruce M. Kapron, Koosha Samieefar
2023-05-09