Approximating nash equilibria using small-support strategies

Authors:
Tomas Feder;Hamid Nazerzadeh;Amin Saberi
Affiliations:
Stanford University, Stanford, CA;Stanford University, Stanford, CA;Stanford University, Stanford, CA
Venue:
Proceedings of the 8th ACM conference on Electronic commerce
Year:
2007

Citing 6
Cited 17

Playing large games using simple strategies

Proceedings of the 4th ACM conference on Electronic commerce
The complexity of computing a Nash equilibrium

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Progress in approximate nash equilibria

Proceedings of the 8th ACM conference on Electronic commerce
A note on approximate nash equilibria

WINE'06 Proceedings of the Second international conference on Internet and Network Economics

Approximate Nash Equilibria for Multi-player Games

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
How hard is it to approximate the best Nash equilibrium?

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An Efficient PTAS for Two-Strategy Anonymous Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Settling the complexity of computing two-player Nash equilibria

Journal of the ACM (JACM)
A note on approximate Nash equilibria

Theoretical Computer Science
New algorithms for approximate Nash equilibria in bimatrix games

Theoretical Computer Science
New algorithms for approximate Nash equilibria in bimatrix games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Gradient-based algorithms for finding Nash equilibria in extensive form games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Approximation guarantees for fictitious play

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On nash-equilibria of approximation-stable games

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Inapproximability of NP-complete variants of nash equilibrium

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
How Hard Is It to Approximate the Best Nash Equilibrium?

SIAM Journal on Computing
On the complexity of approximating a Nash equilibrium

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of approximate nash equilibrium in congestion games with negative delays

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising

Operations Research
Learning equilibria of games via payoff queries

Proceedings of the fourteenth ACM conference on Electronic commerce
On the Complexity of Approximating a Nash Equilibrium

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of finding approximate Nash equilibria of two player games. We show that for any 01 + ε - approximate equilibrium with strategies of support O(log nε2).