Trembling hand perfection is NP-hard
Computer Science and Game Theory
2008-12-03 v1
Authors:
Peter Bro Miltersen
Abstract
It is NP-hard to decide if a given pure-strategy Nash equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect.
Keywords
Cite
@article{arxiv.0812.0492,
title = {Trembling hand perfection is NP-hard},
author = {Peter Bro Miltersen},
journal= {arXiv preprint arXiv:0812.0492},
year = {2008}
}
Related papers
View all related →
Computer Science and Game Theory · Computer Science
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sorensen
2014-08-06
Computer Science and Game Theory · Computer Science
Observable Perfect Equilibrium
Sam Ganzfried
2024-04-30
Computer Science and Game Theory · Computer Science
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Michael Ummels, Dominik Wojtczak
2015-07-01
Computer Science and Game Theory · Computer Science
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
Michael Ummels, Dominik Wojtczak
2010-06-24
Computer Science and Game Theory · Computer Science
Trembling-Hand Perfection and Correlation in Sequential Games
Alberto Marchesi, Nicola Gatti
2020-12-14
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
The Complexity of SPEs in Mean-payoff Games
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2022-04-26
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
On the Computational Complexity of Decision Problems about Multi-Player Nash Equilibria
Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen
2020-01-16
Computational Complexity · Computer Science
Parameterized Two-Player Nash Equilibrium
Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlstrom
2010-06-11
Computer Science and Game Theory · Computer Science
Constrained Pure Nash Equilibria in Polymatrix Games
Sunil Simon, Dominik Wojtczak
2016-11-30
Computer Science and Game Theory · Computer Science
Complexity Results about Nash Equilibria
Vincent Conitzer, Tuomas Sandholm
2007-05-23
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
Logic in Computer Science · Computer Science
Pure Nash Equilibria in Concurrent Deterministic Games
Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels
2017-01-11
Computer Science and Game Theory · Computer Science
Smoothed Complexity of 2-player Nash Equilibria
Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein
2020-07-22
Computer Science and Game Theory · Computer Science
On the Complexity of Nash Equilibria in Anonymous Games
Xi Chen, David Durfee, Anthi Orfanou
2014-12-19
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
Decision Problems for Nash Equilibria in Stochastic Games
Michael Ummels, Dominik Wojtczak
2010-06-24
Quantum Physics · Physics
Analysis of trembling hand perfect equilibria in quantum games
Ireneusz Pakula
2007-05-23
Analysis of PDEs · Mathematics
A "trembling hand perfect" equilibrium for a certain class of mean field games
P. Jameson Graber
2025-06-16
Computer Science and Game Theory · Computer Science
Successful Nash Equilibrium Agent for a 3-Player Imperfect-Information Game
Sam Ganzfried, Austin Nowak, Joannier Pinales
2018-11-07
Optimization and Control · Mathematics
Strong and safe Nash equilibrium in some repeated 3-player games
Tadeusz Kufel, Sławomir Plaskacz, Joanna Zwierzchowska
2018-05-16
Computer Science and Game Theory · Computer Science
The Complexity of Nash Equilibria in Limit-Average Games
Michael Ummels, Dominik Wojtczak
2011-09-29
Computer Science and Game Theory · Computer Science
Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games
Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten
2020-08-19
Computer Science and Game Theory · Computer Science
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan
2026-04-13