Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games

DOI10.1007/978-3-662-44803-8_21zbMath1403.91024arXiv1407.3004OpenAlexW1653262231MaRDI QIDQ2938662

Michail Fasoulakis, Marcin Jurdziński, Artur Czumaj

Publication date: 14 January 2015

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3004

zbMATH Keywords

Nash equilibriumpolynomial-time algorithmbimatrix games

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (6)

Approximate well-supported Nash equilibria below two-thirds ⋮ A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games ⋮ A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games ⋮ Distributed Methods for Computing Approximate Equilibria ⋮ Distributed methods for computing approximate equilibria ⋮ Computing approximate Nash equilibria in polymatrix games

This page was built for publication: Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games