A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.

Louigi Addario-Berry Neil Olver Adrian Vetta

Published in: J. Graph Algorithms Appl. (2007)

Keyphrases

nash equilibria
computational complexity
fictitious play
dynamic programming
worst case
learning algorithm
optimal solution
objective function
game theory
machine learning
cost function
monte carlo
nash equilibrium
stochastic games