Name
Title | ||
|---|---|---|
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. |
Abstract | ||
|---|---|---|
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 FIXPa. 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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-44803-8_20 | ALGORITHMIC GAME THEORY, SAGT 2014 |
DocType | Volume | ISSN |
Journal | 8768 | 0302-9743 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kousha Etessami | 1 | 4177 | 210.71 |
| Kristoffer Arnsfelt Hansen | 2 | 176 | 21.40 |
| Peter Bro Miltersen | 3 | 1146 | 94.49 |
| Troels Bjerre Sørensen | 4 | 181 | 18.08 |