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.

• Type: Journal
• Year: 2007
• Where: JGAA
• Authors: Louigi Addario-Berry, Neil Olver, Adrian Vetta
• Keywords: Graph Representation, JGAA 2007, Simple Directed Graph, Two-player Win-lose Game