Linear solvers for nonlinear games: using pivoting algorithms to find Nash equilibria in n-player games

Authors:
James R. Wright;Albert Xin Jiang;Kevin Leyton-Brown
Affiliations:
University of British Columbia;University of British Columbia;University of British Columbia
Venue:
ACM SIGecom Exchanges
Year:
2011

Citing 3
Cited 0

Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Settling the complexity of computing two-player Nash equilibria

Journal of the ACM (JACM)
The game world is flat: the complexity of nash equilibria in succinct games

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nash equilibria of two-player games are much easier to compute in practice than those of n-player games, even though the two problems have the same asymptotic complexity. We used a recent constructive reduction to solve general games using a two-player algorithm. However, the reduction increases the game size too much to be practically usable. An open problem is to find a more compact constructive reduction, which might make this approach feasible.