On the convergence of regret minimization dynamics in concave games
From MaRDI portal
Publication:5172747
DOI10.1145/1536414.1536486zbMath1304.91015OpenAlexW2060113599MaRDI QIDQ5172747
Yishay Mansour, Eyal Even-Dar, Uri Nadav
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536486
Related Items
No Regret Learning in Oligopolies: Cournot vs. Bertrand ⋮ Strong robustness to incomplete information and the uniqueness of a correlated equilibrium ⋮ Generalized mirror descents in congestion games ⋮ Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues ⋮ Generalized mirror descents with non-convex potential functions in atomic congestion games: continuous time and discrete time ⋮ Opinion dynamics with limited information ⋮ A unified stochastic approximation framework for learning in games ⋮ Learning Stationary Nash Equilibrium Policies in \(n\)-Player Stochastic Games with Independent Chains ⋮ On mutual concavity and strategically-zero-sum bimatrix games ⋮ Beyond myopic best response (in Cournot competition) ⋮ Markets, correlation, and regret-matching ⋮ Opinion dynamics with limited information ⋮ Asymptotic efficiency of the proportional compensation scheme for a large number of producers ⋮ Unnamed Item
