The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form

DOI10.1007/978-3-662-44803-8_20zbMath1403.91018arXiv1408.1017OpenAlexW1896273662MaRDI 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

zbMATH Keywords

strategic-form gamemulti-player gametrembling hand perfect equilibrium

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) (n)-person games, (n>2) (91A06) Rationality and learning in game theory (91A26)

Related Items (3)

Computational complexity of computing a quasi-proper equilibrium ⋮ The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game ⋮ The real computational complexity of minmax value and equilibrium refinements in multi-player games

This page was built for publication: The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form