{"list":"other","total":77,"rows":[{"id":"1707.06347","title":"Proximal Policy Optimization Algorithms","created":"2017-07-20","cited_by_count":15215},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1502.05477","title":"Trust Region Policy Optimization","created":"2015-02-19","cited_by_count":2580},{"id":"1911.10635","title":"Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms","created":"2019-11-24","cited_by_count":567},{"id":"1701.01724","title":"DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker","created":"2017-01-06","cited_by_count":233},{"id":"1912.05830","title":"Provably Efficient Exploration in Policy Optimization","created":"2019-12-12","cited_by_count":205},{"id":"1802.08757","title":"Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents","created":"2018-02-23","cited_by_count":194},{"id":"1311.1869","title":"Optimization, Learning, and Games with Predictable Sequences","created":"2013-11-08","cited_by_count":188},{"id":"1507.00407","title":"Fast Convergence of Regularized Learning in Games","created":"2015-07-02","cited_by_count":150},{"id":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"2206.15378","title":"Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learning","created":"2022-06-30","cited_by_count":131},{"id":"1709.02738","title":"Cycles in adversarial regularized learning","created":"2017-09-08","cited_by_count":124},{"id":"2110.14555","title":"V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL","created":"2021-10-27","cited_by_count":114},{"id":"1408.3595","title":"Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints","created":"2014-08-15","cited_by_count":105},{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101},{"id":"2011.00364","title":"Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization","created":"2020-10-31","cited_by_count":96},{"id":"2106.01969","title":"Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games","created":"2021-06-03","cited_by_count":93},{"id":"2007.07461","title":"Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity","created":"2020-07-15","cited_by_count":92},{"id":"2009.09623","title":"The Complexity of Constrained Min-Max Optimization","created":"2020-09-21","cited_by_count":82},{"id":"2102.04540","title":"Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Games","created":"2021-02-08","cited_by_count":69},{"id":"2106.02326","title":"Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax Problems","created":"2021-06-04","cited_by_count":62},{"id":"2002.00057","title":"Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems","created":"2020-01-31","cited_by_count":60},{"id":"2106.02748","title":"Decentralized Q-Learning in Zero-sum Markov Games","created":"2021-06-04","cited_by_count":58},{"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},{"id":"2004.01339","title":"Multi-agent Reinforcement Learning for Networked System Control","created":"2020-04-03","cited_by_count":53},{"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},{"id":"2010.09514","title":"No-regret learning and mixed Nash equilibria: They do not mix","created":"2020-10-19","cited_by_count":50},{"id":"2204.03991","title":"The Complexity of Markov Equilibrium in Stochastic Games","created":"2022-04-08","cited_by_count":49},{"id":"2107.14702","title":"Towards General Function Approximation in Zero-Sum Markov Games","created":"2021-07-30","cited_by_count":43},{"id":"2110.10614","title":"Independent Natural Policy Gradient Always Converges in Markov Potential Games","created":"2021-10-20","cited_by_count":37},{"id":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36},{"id":"2205.08446","title":"Last-Iterate Convergence of Optimistic Gradient Method for Monotone Variational Inequalities","created":"2022-05-17","cited_by_count":33},{"id":"2210.03096","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","created":"2022-10-06","cited_by_count":32},{"id":"2203.12056","title":"On Last-Iterate Convergence Beyond Zero-Sum Games","created":"2022-03-22","cited_by_count":31},{"id":"2302.06606","title":"Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation","created":"2023-02-13","cited_by_count":30},{"id":"2303.02738","title":"Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback","created":"2023-03-05","cited_by_count":30},{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28},{"id":"2206.01315","title":"Sample-Efficient Reinforcement Learning of Partially Observable Markov Games","created":"2022-06-02","cited_by_count":27},{"id":"2210.01050","title":"Faster Last-iterate Convergence of Policy Optimization in Zero-Sum Markov Games","created":"2022-10-03","cited_by_count":26},{"id":"2207.14211","title":"Regret Minimization and Convergence to Equilibria in General-sum Markov Games","created":"2022-07-28","cited_by_count":24},{"id":"2202.00872","title":"On the Global Convergence Rates of Decentralized Softmax Gradient Play in Markov Potential Games","created":"2022-02-02","cited_by_count":22},{"id":"2205.14590","title":"Independent and Decentralized Learning in Markov Potential Games","created":"2022-05-29","cited_by_count":22},{"id":"1802.00899","title":"Learning Parametric Closed-Loop Policies for Markov Potential Games","created":"2018-02-03","cited_by_count":21},{"id":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","cited_by_count":21},{"id":"2302.09029","title":"Solving stochastic weak Minty variational inequalities without increasing batch size","created":"2023-02-17","cited_by_count":21},{"id":"2302.09831","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","created":"2023-02-20","cited_by_count":21},{"id":"2205.13746","title":"Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games","created":"2022-05-27","cited_by_count":18},{"id":"2206.02640","title":"Policy Optimization for Markov Games: Unified Framework and Faster Convergence","created":"2022-06-06","cited_by_count":16},{"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},{"id":"2303.03100","title":"A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic Games","created":"2023-03-03","cited_by_count":15},{"id":"2204.04186","title":"The Complexity of Infinite-Horizon General-Sum Stochastic Games","created":"2022-04-08","cited_by_count":11},{"id":"2209.12430","title":"$O(T^{-1})$ Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games","created":"2022-09-26","cited_by_count":11},{"id":"2205.11389","title":"Fictitious Play in Markov Games with Single Controller","created":"2022-05-23","cited_by_count":10},{"id":"2209.14110","title":"Meta-Learning in Games","created":"2022-09-28","cited_by_count":10},{"id":"2303.12287","title":"Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games","created":"2023-03-22","cited_by_count":10},{"id":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","cited_by_count":10},{"id":"2204.03132","title":"First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems","created":"2022-04-07","cited_by_count":9},{"id":"2207.12463","title":"Provably Efficient Fictitious Play Policy Optimization for Zero-Sum Markov Games with Structured Transitions","created":"2022-07-25","cited_by_count":9},{"id":"1802.00080","title":"Graphon games: A statistical framework for network games and interventions","created":"2018-01-31","cited_by_count":8},{"id":"2210.12812","title":"Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergence","created":"2022-10-23","cited_by_count":8},{"id":"2301.09619","title":"Asymptotic Convergence and Performance of Multi-Agent Q-Learning Dynamics","created":"2023-01-23","cited_by_count":8},{"id":"2206.07642","title":"Convergence and Price of Anarchy Guarantees of the Softmax Policy Gradient in Markov Potential Games","created":"2022-06-15","cited_by_count":7},{"id":"2207.03470","title":"For Learning in Symmetric Teams, Local Optima are Global Nash Equilibria","created":"2022-07-07","cited_by_count":7},{"id":"2208.02204","title":"Efficiently Computing Nash Equilibria in Adversarial Team Markov Games","created":"2022-08-03","cited_by_count":7},{"id":"2210.09382","title":"Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems","created":"2022-10-17","cited_by_count":7},{"id":"2306.07749","title":"Provably Learning Nash Policies in Constrained Markov Potential Games","created":"2023-06-13","cited_by_count":7},{"id":"2210.10207","title":"Exploitability Minimization in Games and Beyond","created":"2022-10-18","cited_by_count":6},{"id":"2305.14329","title":"Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria","created":"2023-05-23","cited_by_count":5},{"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},{"id":"2210.09769","title":"STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games","created":"2022-10-18","cited_by_count":4},{"id":"1610.03906","title":"Single Controller Stochastic Games for Optimized Moving Target Defense","created":"2016-10-13","cited_by_count":2},{"id":"2302.06607","title":"Generative Adversarial Equilibrium Solvers","created":"2023-02-13","cited_by_count":2},{"id":"2311.00778","title":"Convergence of Heterogeneous Learning Dynamics in Zero-sum Stochastic Games","created":"2023-11-01","cited_by_count":2},{"id":"2312.04905","title":"Two-Timescale Q-Learning with Function Approximation in Zero-Sum Stochastic Games","created":"2023-12-08","cited_by_count":2},{"id":"2308.07873","title":"Near-Optimal Last-iterate Convergence of Policy Optimization in Zero-sum Polymatrix Markov games","created":"2023-08-15","cited_by_count":1},{"id":"2310.16910","title":"Last Iterate Convergence of Popov Method for Non-monotone Stochastic Variational Inequalities","created":"2023-10-25","cited_by_count":1},{"id":"2312.01587","title":"Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains","created":"2023-12-04","cited_by_count":1}],"next_cursor":null}