# The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form

arXiv: https://arxiv.org/abs/1408.1017 · HTML: https://mlsanity.com/paper/1408.1017/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Aug 2014.

## Built on by (most cited first, 1 of 1)

- [Temporal Induced Self-Play for Stochastic Bayesian Games](https://mlsanity.com/paper/2108.09444/) (2021)

## Abstract (arXiv)

We consider the task of computing an approximation of a trembling hand perfect equilibrium for an n-player game in strategic form, n >= 3. We show that this task is complete for the complexity class FIXP_a. In particular, the task is polynomial time equivalent to the task of computing an approximation of a Nash equilibrium in strategic form games with three (or more) players.