The following pages link to (Q5744805):
Displaying 14 items.
- Generalized mirror descents in congestion games (Q334813) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Logarithmic query complexity for approximate Nash computation in large games (Q1733380) (← links)
- Learning convex partitions and computing game-theoretic equilibria from best response queries (Q2190390) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- Query complexity of approximate equilibria in anonymous games (Q2403236) (← links)
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games (Q2819443) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Query Complexity of Approximate Equilibria in Anonymous Games (Q3460801) (← links)
- (Q4638112) (← links)
- (Q5009504) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- Optimally Deceiving a Learning Leader in Stackelberg Games (Q5026202) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
