A polynomial time algorithm for finding nash equilibria in planar win-lose games

Journal of Graph Algorithms and Applications

Volumn 11, Issue 1, 2007, Pages 309-319

  Addario Berry, Louigi ^a   Olver, Neil ^b   Vetta, Adrian ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

GRAPH REPRESENTATION; GRAPH-THEORETIC TECHNIQUE; NASH EQUILIBRIA; POLYNOMIAL-TIME ALGORITHMS; SIMPLE++;

DIRECTED GRAPHS;

EID: 45049085928     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00147     Document Type: Article

References (9)

1. T. Abbott, D. Kane, and P. Valient. On the complexity of two-player win-lose games. In Proceedings of the 43rd Annual IEEE Symposium on Foun-dations of Computer Science (FOCS), pages 113-122, 2005.
2. X. Chen and X. Deng. Settling the complexity of 2-player Nash-equilibrium. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Com-puter Science (FOCS), pages 261-272, 2006.
3. X. Chen, S. Teng, and P. Valiant. The approximation complexity of win-lose games. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 159-168, 2007.
4. B. Codenotti, M. Leoncini, and G. Resta. Efficient computation of Nash equilibria for very sparse win-lose games. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pages 232-243, 2006.
5. B. Codenotti and D. Stefankovic. On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Information Processing Letters, 94(3):145-150, 2005.
6. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to algorithms. McGraw-Hill, second edition, 2001.
7. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of com-puting a Nash equilibria. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 71-78, 2006.
8. P. Goldberg and C. Papadimitriou. Reducibility among equilibrium prob-lems. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 61-70, 2006.
9. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.