Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
From MaRDI portal
Publication:5428842
DOI10.1007/978-3-540-73420-8_52zbMath1171.91305OpenAlexW1520466390MaRDI QIDQ5428842
Paul G. Spirakis, Spyros C. Kontogiannis
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_52
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) 2-person games (91A05)
Related Items (11)
Approximate well-supported Nash equilibria below two-thirds ⋮ An algorithm for finding approximate Nash equilibria in bimatrix games ⋮ Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem ⋮ On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ Equilibria, fixed points, and complexity classes ⋮ Well supported approximate equilibria in bimatrix games ⋮ Approximate Equilibria for Strategic Two Person Games ⋮ A note on approximate Nash equilibria ⋮ Polynomial algorithms for approximating Nash equilibria of bimatrix games ⋮ New algorithms for approximate Nash equilibria in bimatrix games
This page was built for publication: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
