Cyclic games and an algorithm to find minimax cycle means in directed graphs
USSR Computational Mathematics and Mathematical Physics
The complexity of mean payoff games on graphs
Theoretical Computer Science
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
Strategic bidder behavior in sponsored search auctions
Decision Support Systems
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
Nash equilibria in random games
Random Structures & Algorithms
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability of pure nash equilibria
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
New algorithms for approximate Nash equilibria in bimatrix games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Mixing time and stationary expected social welfare of logit dynamics
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Stochastic mean payoff games: smoothed analysis and approximation schemes
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Polynomial-Time algorithms for energy games with special weight structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The complexity of infinitely repeated alternating move games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.00 |
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show that alternating move games are more tractable than simultaneous move games: we give an FPTAS for computing an ε-approximate equilibrium of an alternating move game with any number of players. In contrast, it is known that for k ≥ 3 players, there is no FPTAS for computing Nash equilibria of simultaneous move repeated games unless P = PPAD. We also consider equilibria in memoryless strategies, which are guaranteed to exist in two player games. We show that for the special case of k = 2 players, all but a negligible fraction of games admit an equilibrium in pure memoryless strategies that can be found in polynomial time. Moreover, we give a PTAS to compute an ε-approximate equilibrium in pure memoryless strategies in any 2 player game that admits an exact equilibrium in pure memoryless strategies.