{"total":47,"rows":[{"id":"2106.01969","title":"Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games","created":"2021-06-03","cited_by_count":93,"area":null},{"id":"2108.06924","title":"Near-Optimal No-Regret Learning in General Games","created":"2021-08-16","cited_by_count":85,"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":"2107.13090","title":"Policy Gradient Methods Find the Nash Equilibrium in N-player General-sum Linear-quadratic Games","created":"2021-07-27","cited_by_count":25,"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":"2206.03922","title":"A unified stochastic approximation framework for learning in games","created":"2022-06-08","cited_by_count":23,"area":null},{"id":"2401.16198","title":"Contracting with a Learning Agent","created":"2024-01-29","cited_by_count":23,"area":null},{"id":"2210.08857","title":"On the convergence of policy gradient methods to Nash equilibria in general stochastic games","created":"2022-10-17","cited_by_count":16,"area":null},{"id":"2110.06256","title":"Neural Network Weights Do Not Converge to Stationary Points: An Invariant Measure Perspective","created":"2021-10-12","cited_by_count":15,"area":null},{"id":"2301.11241","title":"On the Convergence of No-Regret Learning Dynamics in Time-Varying Games","created":"2023-01-26","cited_by_count":14,"area":null},{"id":"2406.10631","title":"Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms","created":"2024-06-15","cited_by_count":14,"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":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2110.03906","title":"Nash Convergence of Mean-Based Learning Algorithms in First-Price Auctions","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2301.09619","title":"Asymptotic Convergence and Performance of Multi-Agent Q-Learning Dynamics","created":"2023-01-23","cited_by_count":8,"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":"2302.02333","title":"Learning in quantum games","created":"2023-02-05","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":"2405.07224","title":"A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights","created":"2024-05-12","cited_by_count":4,"area":null},{"id":"2412.20203","title":"No-regret learning in harmonic games: Extrapolation in the face of conflicting interests","created":"2024-12-28","cited_by_count":4,"area":null},{"id":"2207.07971","title":"A Survey of Decision Making in Adversarial Games","created":"2022-07-16","cited_by_count":3,"area":null},{"id":"2209.15230","title":"The Replicator Dynamic, Chain Components and the Response Graph","created":"2022-09-30","cited_by_count":3,"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":"2202.11871","title":"No-Regret Learning in Games is Turing Complete","created":"2022-02-24","cited_by_count":2,"area":null},{"id":"2306.16617","title":"Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation","created":"2023-06-29","cited_by_count":2,"area":null},{"id":"2312.12067","title":"Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property","created":"2023-12-19","cited_by_count":2,"area":null},{"id":"2402.19420","title":"Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning","created":"2024-02-29","cited_by_count":2,"area":null},{"id":"2412.20365","title":"Accelerated regularized learning in finite N-person games","created":"2024-12-29","cited_by_count":2,"area":null},{"id":"2506.13286","title":"The impact of uncertainty on regularized learning in games","created":"2025-06-16","cited_by_count":2,"area":null},{"id":"2606.28308","title":"Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes","created":"2026-06-26","cited_by_count":2,"area":null},{"id":"2111.09982","title":"Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting","created":"2021-11-18","cited_by_count":1,"area":null},{"id":"2202.09364","title":"Playing against no-regret players","created":"2022-02-16","cited_by_count":1,"area":null},{"id":"2205.00473","title":"A Survey on Distributed Online Optimization and Game","created":"2022-05-01","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":"2502.07975","title":"Sink equilibria and the attractors of learning in games","created":"2025-02-11","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":"2304.04665","title":"On algorithmically boosting fixed-point computations","created":"2023-04-04","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":"2311.05201","title":"Green Resilience of Cyber-Physical Systems","created":"2023-11-09","cited_by_count":0,"area":null},{"id":"2411.02308","title":"Nash Equilibria via Stochastic Eigendecomposition","created":"2024-11-04","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":"2507.03150","title":"Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games","created":"2025-07-03","cited_by_count":0,"area":null},{"id":"2509.23157","title":"Grouped Satisficing Paths in Pure Strategy Games: a Topological Perspective","created":"2025-09-27","cited_by_count":0,"area":null},{"id":"2510.14907","title":"Learnable Mixed Nash Equilibria are Collectively Rational","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2512.08138","title":"Robust equilibria in continuous games: From strategic to dynamic robustness","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2608.09389","title":"Regret, equilibrium, and learning in games: A guided tour","created":"2026-08-10","cited_by_count":0,"area":null}],"next_cursor":null}