Sciweavers

JGAA
2007

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

13 years 3 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. In particular, we give a polynomial time algorithm for finding a Nash equilibrium in a two-player win-lose game whose graph representation is planar.
Louigi Addario-Berry, Neil Olver, Adrian Vetta
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JGAA
Authors Louigi Addario-Berry, Neil Olver, Adrian Vetta
Comments (0)