Login / Signup
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games.
Argyrios Deligkas
Michail Fasoulakis
Evangelos Markakis
Published in:
ACM Trans. Algorithms (2023)
Keyphrases
</>
nash equilibria
fictitious play
computational complexity
game theory
dynamic programming
nash equilibrium
worst case
learning algorithm
objective function
cost function
incomplete information
np hard
search space
optimal solution
stochastic games
game theoretic
solution concepts