Content tagged with distinction

• [C93] No-regret learning in harmonic games: Extrapolation in the presence of conflicting interests
• [C92] A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights
• [C88] The equivalence of dynamic and strategic stability under regularized learning in games
• [C77] UnderGrad: A universal black-box optimization method with almost dimension-free convergence rate guarantees
• [J33] Robust power management via learning and game design
• [C64] The limits of min-max optimization algorithms: Convergence to spurious non-critical sets
• [C59] No-regret learning and mixed Nash equilibria: They do not mix
• [C57] Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling
• [C51] Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach
• [C9] Strange bedfellows: Riemann, Gibbs and vector Gaussian multiple access channels