The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form
From MaRDI portal
Publication:2938661
DOI10.1007/978-3-662-44803-8_20zbMath1403.91018arXiv1408.1017MaRDI QIDQ2938661
Kousha Etessami, Troels Bjerre Sørensen, Peter Bro Miltersen, Kristoffer Arnsfelt Hansen
Publication date: 14 January 2015
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1017
68Q25: Analysis of algorithms and problem complexity
91A06: (n)-person games, (n>2)
91A26: Rationality and learning in game theory
Related Items
The real computational complexity of minmax value and equilibrium refinements in multi-player games, The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game, Computational complexity of computing a quasi-proper equilibrium