A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games.

Argyrios Deligkas Michail Fasoulakis Evangelos Markakis

Published in: ESA (2022)

Keyphrases

nash equilibria
fictitious play
computational complexity
nash equilibrium
game theory
dynamic programming
worst case
objective function
learning algorithm
linear programming
cost function
approximation algorithms
game theoretic
optimal solution
np hard
special case
stochastic games