{"total":29,"rows":[{"id":"2110.04184","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?","created":"2021-10-08","cited_by_count":67,"area":null},{"id":"2202.04129","title":"Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergence","created":"2022-02-08","cited_by_count":57,"area":null},{"id":"2104.12761","title":"Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium","created":"2021-04-26","cited_by_count":51,"area":null},{"id":"2110.10614","title":"Independent Natural Policy Gradient Always Converges in Markov Potential Games","created":"2021-10-20","cited_by_count":37,"area":null},{"id":"2201.10483","title":"Multi-agent Performative Prediction: From Global Stability and Optimality to Chaos","created":"2022-01-25","cited_by_count":33,"area":null},{"id":"2103.00623","title":"Scaling up Mean Field Games with Online Mirror Descent","created":"2021-02-28","cited_by_count":32,"area":null},{"id":"2101.04667","title":"Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information","created":"2021-01-12","cited_by_count":23,"area":null},{"id":"2111.14737","title":"Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update","created":"2021-11-29","cited_by_count":20,"area":null},{"id":"2103.03405","title":"Learning in Matrix Games can be Arbitrarily Complex","created":"2021-03-05","cited_by_count":11,"area":null},{"id":"2102.07974","title":"Follow-the-Regularized-Leader Routes to Chaos in Routing Games","created":"2021-02-16","cited_by_count":10,"area":null},{"id":"2204.05466","title":"Independent Natural Policy Gradient Methods for Potential Games: Finite-time Global Convergence with Entropy Regularization","created":"2022-04-12","cited_by_count":10,"area":null},{"id":"2204.01509","title":"The Group Loss++: A deeper look into group loss for deep metric learning","created":"2022-04-04","cited_by_count":6,"area":null},{"id":"2203.14129","title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","created":"2022-03-26","cited_by_count":4,"area":null},{"id":"2207.08426","title":"Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games","created":"2022-07-18","cited_by_count":4,"area":null},{"id":"2311.02407","title":"The equivalence of dynamic and strategic stability under regularized learning in games","created":"2023-11-04","cited_by_count":4,"area":null},{"id":"2409.18582","title":"Optimistic Games for Combinatorial Bayesian Optimization with Application to Protein Design","created":"2024-09-27","cited_by_count":4,"area":null},{"id":"2106.14668","title":"Evolutionary Dynamics and $\\Phi$-Regret Minimization in Games","created":"2021-06-28","cited_by_count":2,"area":null},{"id":"2110.10295","title":"Expressivity of Neural Networks via Chaotic Itineraries beyond Sharkovsky's Theorem","created":"2021-10-19","cited_by_count":2,"area":null},{"id":"2306.13673","title":"Taming the Exponential Action Set: Sublinear Regret and Fast Convergence to Nash Equilibrium in Online Congestion Games","created":"2023-06-19","cited_by_count":2,"area":null},{"id":"2510.17067","title":"Convergence of Regret Matching in Potential Games and Constrained Optimization","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2404.06516","title":"Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games","created":"2024-04-04","cited_by_count":1,"area":null},{"id":"2408.11146","title":"Swim till You Sink: Computing the Limit of a Game","created":"2024-08-20","cited_by_count":1,"area":null},{"id":"2109.03974","title":"Constants of Motion: The Antidote to Chaos in Optimization and Game Dynamics","created":"2021-09-08","cited_by_count":0,"area":null},{"id":"2306.01032","title":"Chaos persists in large-scale multi-agent learning despite adaptive learning rates","created":"2023-06-01","cited_by_count":0,"area":null},{"id":"2407.06676","title":"Games played by Exponential Weights Algorithms","created":"2024-07-09","cited_by_count":0,"area":null},{"id":"2411.03802","title":"On the Decomposition of Differential Game","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2502.08063","title":"Last-iterate Convergence for Symmetric, General-sum, $2 \\times 2$ Games Under The Exponential Weights Dynamic","created":"2025-02-12","cited_by_count":0,"area":null},{"id":"2502.19210","title":"Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Management","created":"2025-02-26","cited_by_count":0,"area":null},{"id":"2607.21805","title":"Natural Invariant Measures for Chaotic Game Dynamics: Finding Order in Chaos","created":"2026-07-23","cited_by_count":0,"area":null}],"next_cursor":null}