4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.GT2022★ 1 cited
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis
Since the seminal PPAD-completeness result for computing a Nash equilibrium even in two-player games, an important line of research has focused on relaxations achievable in polynom…
cs.GT2014★ 4 cited
Approximate well-supported Nash equilibria in symmetric bimatrix games
Artur Czumaj, Michail Fasoulakis, Marcin Jurdziński
The -well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than to deviate…