{"list":"other","total":65,"rows":[{"id":"1702.08165","title":"Reinforcement Learning with Deep Energy-Based Policies","created":"2017-02-27","cited_by_count":669},{"id":"1911.10635","title":"Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms","created":"2019-11-24","cited_by_count":567},{"id":"1909.07528","title":"Emergent Tool Use From Multi-Agent Autocurricula","created":"2019-09-17","cited_by_count":313},{"id":"1610.03295","title":"Safe, Multi-Agent, Reinforcement Learning for Autonomous Driving","created":"2016-10-11","cited_by_count":311},{"id":"1708.04782","title":"StarCraft II: A New Challenge for Reinforcement Learning","created":"2017-08-16","cited_by_count":274},{"id":"2005.06392","title":"On the Global Convergence Rates of Softmax Policy Gradient Methods","created":"2020-05-13","cited_by_count":264},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"1802.08757","title":"Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents","created":"2018-02-23","cited_by_count":194},{"id":"1705.07798","title":"A unified view of entropy-regularized Markov decision processes","created":"2017-05-22","cited_by_count":182},{"id":"2007.06558","title":"Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularization","created":"2020-07-13","cited_by_count":176},{"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":"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":"2002.04017","title":"Provable Self-Play Algorithms for Competitive Reinforcement Learning","created":"2020-02-10","cited_by_count":113},{"id":"2006.12007","title":"Near-Optimal Reinforcement Learning with Self-Play","created":"2020-06-22","cited_by_count":109},{"id":"2010.01604","title":"A Sharp Analysis of Model-based Reinforcement Learning with Self-Play","created":"2020-10-04","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":"2002.07066","title":"Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium","created":"2020-02-17","cited_by_count":100},{"id":"1807.04252","title":"Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization","created":"2018-07-11","cited_by_count":98},{"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":"2108.06924","title":"Near-Optimal No-Regret Learning in General Games","created":"2021-08-16","cited_by_count":85},{"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":"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},{"id":"2206.05825","title":"A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games","created":"2022-06-12","cited_by_count":66},{"id":"2105.15186","title":"Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization","created":"2021-05-31","cited_by_count":63},{"id":"2007.03458","title":"Fictitious Play for Mean Field Games: Continuous Time Analysis and Applications","created":"2020-07-05","cited_by_count":62},{"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":"2204.03991","title":"The Complexity of Markov Equilibrium in Stochastic Games","created":"2022-04-08","cited_by_count":49},{"id":"1908.11071","title":"Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity","created":"2019-08-29","cited_by_count":42},{"id":"2110.05682","title":"Provably Efficient Reinforcement Learning in Decentralized General-Sum Markov Games","created":"2021-10-12","cited_by_count":42},{"id":"2110.05707","title":"On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning","created":"2021-10-12","cited_by_count":36},{"id":"2204.11417","title":"Uncoupled Learning Dynamics with $O(\\log T)$ Swap Regret in Multiplayer Games","created":"2022-04-25","cited_by_count":35},{"id":"2106.00198","title":"Gradient play in stochastic games: stationary points, convergence, and sample complexity","created":"2021-06-01","cited_by_count":34},{"id":"1606.04550","title":"Settling the complexity of computing approximate two-player Nash equilibria","created":"2016-06-14","cited_by_count":31},{"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":"2302.03673","title":"Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation","created":"2023-02-07","cited_by_count":27},{"id":"2010.04223","title":"Fictitious play in zero-sum stochastic games","created":"2020-10-08","cited_by_count":26},{"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":"2206.08742","title":"Near-Optimal No-Regret Learning Dynamics for General Convex Games","created":"2022-06-17","cited_by_count":25},{"id":"1912.02906","title":"Scalable Reinforcement Learning for Multi-Agent Networked Systems","created":"2019-12-05","cited_by_count":24},{"id":"2207.14211","title":"Regret Minimization and Convergence to Equilibria in General-sum Markov Games","created":"2022-07-28","cited_by_count":24},{"id":"2111.11743","title":"Independent Learning in Stochastic Games","created":"2021-11-23","cited_by_count":22},{"id":"1301.2281","title":"Graphical Models for Game Theory","created":"2013-01-10","cited_by_count":21},{"id":"2106.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","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":"2211.17116","title":"Global Convergence of Localized Policy Iteration in Networked Multi-Agent Reinforcement Learning","created":"2022-11-30","cited_by_count":20},{"id":"2205.13746","title":"Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games","created":"2022-05-27","cited_by_count":18},{"id":"2208.10458","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","created":"2022-08-22","cited_by_count":15},{"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":"2111.04317","title":"Best-Response Dynamics and Fictitious Play in Identical-Interest and Zero-Sum Stochastic Games","created":"2021-11-08","cited_by_count":10},{"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},{"id":"2205.11389","title":"Fictitious Play in Markov Games with Single Controller","created":"2022-05-23","cited_by_count":10},{"id":"2303.04865","title":"Convergence Rates for Localized Actor-Critic in Networked Markov Potential Games","created":"2023-03-08","cited_by_count":9},{"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":"2110.02355","title":"Robustness and sample complexity of model-based MARL for general-sum Markov games","created":"2021-10-05","cited_by_count":6},{"id":"2211.08980","title":"Asynchronous Gradient Play in Zero-Sum Multi-agent Games","created":"2022-11-16","cited_by_count":5},{"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":"1504.02411","title":"Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash","created":"2015-04-09","cited_by_count":4},{"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":"2204.01382","title":"On the Global Convergence of Stochastic Fictitious Play in Stochastic Games with Turn-based Controllers","created":"2022-04-04","cited_by_count":3}],"next_cursor":null}