{"total":46,"rows":[{"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,"area":null},{"id":"2203.11973","title":"Scalable Deep Reinforcement Learning Algorithms for Mean Field Games","created":"2022-03-22","cited_by_count":38,"area":null},{"id":"2103.04564","title":"Discovering Diverse Multi-Agent Strategic Behavior via Reward Randomization","created":"2021-03-08","cited_by_count":35,"area":null},{"id":"2211.00241","title":"Adversarial Policies Beat Superhuman Go AIs","created":"2022-11-01","cited_by_count":29,"area":null},{"id":"2212.14449","title":"Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Games","created":"2022-12-29","cited_by_count":26,"area":null},{"id":"2206.04122","title":"ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret","created":"2022-06-08","cited_by_count":24,"area":null},{"id":"2112.03178","title":"Student of Games: A unified learning algorithm for both perfect and imperfect information games","created":"2021-12-06","cited_by_count":23,"area":null},{"id":"2106.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","cited_by_count":21,"area":null},{"id":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","cited_by_count":21,"area":null},{"id":"2302.01275","title":"ReLOAD: Reinforcement Learning with Optimistic Ascent-Descent for Last-Iterate Convergence in Constrained MDPs","created":"2023-02-02","cited_by_count":20,"area":null},{"id":"2102.08903","title":"Provably Efficient Policy Optimization for Two-Player Zero-Sum Markov Games","created":"2021-02-17","cited_by_count":18,"area":null},{"id":"2102.08431","title":"Complex Momentum for Optimization in Games","created":"2021-02-16","cited_by_count":11,"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":"2207.06541","title":"Self-Play PSRO: Toward Optimal Populations in Two-Player Zero-Sum Games","created":"2022-07-13","cited_by_count":11,"area":null},{"id":"2111.03377","title":"Online Learning in Periodic Zero-Sum Games","created":"2021-11-05","cited_by_count":10,"area":null},{"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,"area":null},{"id":"2208.09855","title":"Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games","created":"2022-08-21","cited_by_count":9,"area":null},{"id":"2305.16610","title":"Adaptively Perturbed Mirror Descent for Learning in Games","created":"2023-05-26","cited_by_count":9,"area":null},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8,"area":null},{"id":"2111.05884","title":"Search in Imperfect Information Games","created":"2021-11-10","cited_by_count":8,"area":null},{"id":"2206.09254","title":"Mutation-Driven Follow the Regularized Leader for Last-Iterate Convergence in Zero-Sum Games","created":"2022-06-18","cited_by_count":8,"area":null},{"id":"2305.17342","title":"Rethinking Adversarial Policies: A Generalized Attack Formulation and Provable Defense in RL","created":"2023-05-27","cited_by_count":7,"area":null},{"id":"2404.13891","title":"Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent","created":"2024-04-22","cited_by_count":7,"area":null},{"id":"2301.09159","title":"Abstracting Imperfect Information Away from Two-Player Zero-Sum Games","created":"2023-01-22","cited_by_count":6,"area":null},{"id":"2310.03354","title":"Fictitious Cross-Play: Learning Global Nash Equilibrium in Mixed Cooperative-Competitive Games","created":"2023-10-05","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":"2401.05133","title":"Neural Population Learning beyond Symmetric Zero-sum Games","created":"2024-01-10","cited_by_count":4,"area":null},{"id":"2106.04748","title":"Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincar\\'e Recurrence","created":"2021-06-09","cited_by_count":3,"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":"2304.13138","title":"The Update-Equivalence Framework for Decision-Time Planning","created":"2023-04-25","cited_by_count":3,"area":null},{"id":"2209.10958","title":"Developing, Evaluating and Scaling Learning Agents in Multi-Agent Environments","created":"2022-09-22","cited_by_count":2,"area":null},{"id":"2308.04719","title":"JiangJun: Mastering Xiangqi by Tackling Non-Transitivity in Two-Player Zero-Sum Games","created":"2023-08-09","cited_by_count":2,"area":null},{"id":"2311.17190","title":"Minimax Exploiter: A Data Efficient Approach for Competitive Self-Play","created":"2023-11-28","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":"2208.09452","title":"Unified Policy Optimization for Continuous-action Reinforcement Learning in Non-stationary Tasks and Games","created":"2022-08-19","cited_by_count":1,"area":null},{"id":"2501.16600","title":"On the Power of Perturbation under Sampling in Solving Extensive-Form Games","created":"2025-01-28","cited_by_count":1,"area":null},{"id":"2503.12770","title":"Faster Game Solving via Asymmetry of Step Sizes","created":"2025-03-17","cited_by_count":1,"area":null},{"id":"2607.17543","title":"The Curvature Shadow: An Apparent Failure of Maximum-Entropy Equilibrium Selection is a Removable Artifact","created":"2026-07-20","cited_by_count":1,"area":null},{"id":"2307.12062","title":"Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations","created":"2023-07-22","cited_by_count":0,"area":null},{"id":"2308.11256","title":"Efficient Last-iterate Convergence Algorithms in Solving Games","created":"2023-08-22","cited_by_count":0,"area":null},{"id":"2410.05127","title":"Last Iterate Convergence in Monotone Mean Field Games","created":"2024-10-07","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":"2411.12725","title":"The Bounds of Algorithmic Collusion; $Q$-learning, Gradient Learning, and the Folk Theorem","created":"2024-11-19","cited_by_count":0,"area":null},{"id":"2509.13653","title":"Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation","created":"2025-09-17","cited_by_count":0,"area":null},{"id":"2609.19820","title":"Steering Equilibrium Selection in Regularized Self-Play via the Reference Policy","created":"2026-09-17","cited_by_count":0,"area":null}],"next_cursor":null}