Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

Cites Work

Non-cooperative games
An optimization approach for approximate Nash equilibria
Entropy waves, the zig-zag graph product, and new constant-degree expanders
The complexity of computing a Nash equilibrium
Title not available (Why is that?)
Rational Learning Leads to Nash Equilibrium
Probability and Computing
An iterative method of solving a game
Chernoff–Hoeffding Bounds for Applications with Limited Independence
From external to internal regret
A note on approximate Nash equilibria
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Settling the complexity of computing two-player Nash equilibria
New algorithms for approximate Nash equilibria in bimatrix games
Learning equilibria of games via payoff queries
The query complexity of correlated equilibria
Completely uncoupled dynamics and Nash equilibria
How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
On sparse approximations to randomized strategies and convex combinations
On oblivious PTAS's for nash equilibrium
Exponential lower bounds for finding Brouwer fixed points
Inapproximability of Nash equilibrium
Communication complexity of approximate Nash equilibria
On the communication complexity of approximate Nash equilibria
Communication lower bounds via critical block sensitivity
Simple complexity from imitation games
Distributed Methods for Computing Approximate Equilibria
Query Complexity of Approximate Nash Equilibria
Rectangles are nonnegative juntas
Query-to-Communication Lifting for BPP
Settling the complexity of Nash equilibrium in congestion games
The communication complexity of local search
On the virtue of succinct proofs
Title not available (Why is that?)
Title not available (Why is that?)

This page was built for publication: Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139831)