Learning equilibria of games via payoff queries
From MaRDI portal
Recommendations
Cited in
(21)- Logarithmic query complexity for approximate Nash computation in large games
- Learning convex partitions and computing game-theoretic equilibria from best response queries
- Achieving target equilibria in network routing games without knowing the latency functions
- Learning payoff functions in infinite games
- Query complexity of approximate equilibria in anonymous games
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Distributed Methods for Computing Approximate Equilibria
- Solving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning Methods
- Generalized mirror descents in congestion games
- Query complexity of approximate equilibria in anonymous games
- Inverse game theory: learning utilities in succinct games
- scientific article; zbMATH DE number 6866347 (Why is no real title available?)
- Communication complexity of correlated equilibrium with small support
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Optimally Deceiving a Learning Leader in Stackelberg Games
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Exploiting extensive-form structure in empirical game-theoretic analysis
- Distributed methods for computing approximate equilibria
- On the complexity of computing sparse equilibria and lower bounds for no-regret learning in games
- Empirical game theoretic analysis: a survey
- A payoff-based learning procedure and its application to traffic games
This page was built for publication: Learning equilibria of games via payoff queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5744805)
