{"total":67,"rows":[{"id":"2110.14555","title":"V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL","created":"2021-10-27","cited_by_count":114,"area":null},{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"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,"area":null},{"id":"2106.02748","title":"Decentralized Q-Learning in Zero-sum Markov Games","created":"2021-06-04","cited_by_count":58,"area":null},{"id":"2204.03991","title":"The Complexity of Markov Equilibrium in Stochastic Games","created":"2022-04-08","cited_by_count":49,"area":null},{"id":"2106.03352","title":"The Power of Exploiter: Provable Multi-Agent RL in Large State Spaces","created":"2021-06-07","cited_by_count":48,"area":null},{"id":"2107.14702","title":"Towards General Function Approximation in Zero-Sum Markov Games","created":"2021-07-30","cited_by_count":43,"area":null},{"id":"2110.05682","title":"Provably Efficient Reinforcement Learning in Decentralized General-Sum Markov Games","created":"2021-10-12","cited_by_count":42,"area":null},{"id":"2110.05707","title":"On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning","created":"2021-10-12","cited_by_count":36,"area":null},{"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,"area":null},{"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,"area":null},{"id":"2206.01315","title":"Sample-Efficient Reinforcement Learning of Partially Observable Markov Games","created":"2022-06-02","cited_by_count":27,"area":null},{"id":"2202.01752","title":"Near-Optimal Learning of Extensive-Form Games with Imperfect Information","created":"2022-02-03","cited_by_count":26,"area":null},{"id":"2102.07404","title":"Almost Optimal Algorithms for Two-player Zero-Sum Linear Mixture Markov Games","created":"2021-02-15","cited_by_count":25,"area":null},{"id":"2112.13521","title":"Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?","created":"2021-12-27","cited_by_count":24,"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":"2207.14211","title":"Regret Minimization and Convergence to Equilibria in General-sum Markov Games","created":"2022-07-28","cited_by_count":24,"area":null},{"id":"2502.16852","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","created":"2025-02-24","cited_by_count":24,"area":"alignment"},{"id":"2111.11743","title":"Independent Learning in Stochastic Games","created":"2021-11-23","cited_by_count":22,"area":null},{"id":"2205.14590","title":"Independent and Decentralized Learning in Markov Potential Games","created":"2022-05-29","cited_by_count":22,"area":null},{"id":"2109.01795","title":"On the Complexity of Computing Markov Perfect Equilibrium in General-Sum Stochastic Games","created":"2021-09-04","cited_by_count":19,"area":null},{"id":"2302.02571","title":"Offline Learning in Markov Games with General Function Approximation","created":"2023-02-06","cited_by_count":18,"area":"offlinerl"},{"id":"2203.06803","title":"Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits","created":"2022-03-14","cited_by_count":17,"area":null},{"id":"2206.02640","title":"Policy Optimization for Markov Games: Unified Framework and Faster Convergence","created":"2022-06-06","cited_by_count":16,"area":null},{"id":"2208.10458","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","created":"2022-08-22","cited_by_count":15,"area":null},{"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,"area":null},{"id":"2306.00212","title":"Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2402.09838","title":"Performative Reinforcement Learning in Gradually Shifting Environments","created":"2024-02-15","cited_by_count":14,"area":"deeprl"},{"id":"2202.04786","title":"No-Regret Learning in Dynamic Stackelberg Games","created":"2022-02-10","cited_by_count":12,"area":null},{"id":"2206.01588","title":"Decentralized Optimistic Hyperpolicy Mirror Descent: Provably No-Regret Learning in Markov Games","created":"2022-06-03","cited_by_count":12,"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":"2212.12567","title":"Adapting to game trees in zero-sum imperfect information games","created":"2022-12-23","cited_by_count":11,"area":null},{"id":"2110.04638","title":"Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games","created":"2021-10-09","cited_by_count":9,"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.11040","title":"Strategic Decision-Making in the Presence of Information Asymmetry: Provably Efficient RL with Algorithmic Instruments","created":"2022-08-23","cited_by_count":9,"area":"offlinerl"},{"id":"2303.03095","title":"Can We Find Nash Equilibria at a Linear Rate in Markov Games?","created":"2023-03-03","cited_by_count":9,"area":null},{"id":"2206.03348","title":"Specification-Guided Learning of Nash Equilibria with High Social Welfare","created":"2022-06-06","cited_by_count":8,"area":null},{"id":"2605.13025","title":"Offline Two-Player Zero-Sum Markov Games with KL Regularization","created":"2026-05-13","cited_by_count":6,"area":null},{"id":"2301.10230","title":"Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints","created":"2023-01-24","cited_by_count":5,"area":null},{"id":"2509.14203","title":"Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain","created":"2025-09-17","cited_by_count":5,"area":null},{"id":"2109.03396","title":"A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent","created":"2021-09-08","cited_by_count":4,"area":null},{"id":"2112.07859","title":"Finite-Sample Analysis of Decentralized Q-Learning for Stochastic Games","created":"2021-12-15","cited_by_count":4,"area":null},{"id":"2302.02984","title":"Robust Subtask Learning for Compositional Generalization","created":"2023-02-06","cited_by_count":4,"area":null},{"id":"2602.06348","title":"Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret","created":"2026-02-06","cited_by_count":4,"area":null},{"id":"2110.03604","title":"Online Markov Decision Processes with Non-oblivious Strategic Adversary","created":"2021-10-07","cited_by_count":3,"area":null},{"id":"2302.03364","title":"Population-size-Aware Policy Optimization for Mean-Field Games","created":"2023-02-07","cited_by_count":3,"area":null},{"id":"2306.05700","title":"Finite-Time Analysis of Minimax Q-Learning for Two-Player Zero-Sum Markov Games: Switching System Approach","created":"2023-06-09","cited_by_count":3,"area":null},{"id":"2411.00707","title":"Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms","created":"2024-11-01","cited_by_count":3,"area":null},{"id":"2309.00656","title":"Local and adaptive mirror descents in extensive-form games","created":"2023-09-01","cited_by_count":2,"area":null},{"id":"2312.08008","title":"Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions","created":"2023-12-13","cited_by_count":2,"area":null},{"id":"2606.03698","title":"Multi$^2$: Hierarchical Multi-Agent Decision-Making with LLM-Based Agents in Interactive Environments","created":"2026-06-02","cited_by_count":2,"area":"agents"},{"id":"2208.05363","title":"Learning Two-Player Mixture Markov Games: Kernel Function Approximation and Correlated Equilibrium","created":"2022-08-10","cited_by_count":1,"area":null},{"id":"2211.15792","title":"Provably Efficient Model-free RL in Leader-Follower MDP with Linear Function Approximation","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2310.06243","title":"Sample-Efficient Multi-Agent RL: An Optimization Perspective","created":"2023-10-10","cited_by_count":1,"area":null},{"id":"2411.06069","title":"Model Selection for Average Reward RL with Application to Utility Maximization in Repeated Games","created":"2024-11-09","cited_by_count":1,"area":null},{"id":"2506.23703","title":"A New Perspective On AI Safety Through Control Theory Methodologies","created":"2025-06-30","cited_by_count":1,"area":null},{"id":"2510.05526","title":"Provably Mitigating Corruption, Overoptimization, and Verbosity Simultaneously in Offline and Online RLHF/DPO Alignment","created":"2025-10-07","cited_by_count":1,"area":"alignment"},{"id":"2602.07205","title":"Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2603.20604","title":"Bayesian Learning in Episodic Zero-Sum Games","created":"2026-03-21","cited_by_count":1,"area":"alignment"},{"id":"2101.01178","title":"Advances in Electron Microscopy with Deep Learning","created":"2021-01-04","cited_by_count":0,"area":null},{"id":"2110.02129","title":"A study of first-passage time minimization via Q-learning in heated gridworlds","created":"2021-10-05","cited_by_count":0,"area":null},{"id":"2202.10008","title":"Double Thompson Sampling in Finite stochastic Games","created":"2022-02-21","cited_by_count":0,"area":null},{"id":"2301.05630","title":"Decentralized model-free reinforcement learning in stochastic games with average-reward objective","created":"2023-01-13","cited_by_count":0,"area":null},{"id":"2308.08858","title":"Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games","created":"2023-08-17","cited_by_count":0,"area":null},{"id":"2406.10411","title":"Tree Search for Simultaneous Move Games via Equilibrium Approximation","created":"2024-06-14","cited_by_count":0,"area":null},{"id":"2507.02211","title":"Dilution, Diffusion and Symbiosis in Spatial Prisoner's Dilemma with Reinforcement Learning","created":"2025-07-03","cited_by_count":0,"area":"deeprl"},{"id":"2602.21020","title":"Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning","created":"2026-02-24","cited_by_count":0,"area":"offlinerl"}],"next_cursor":null}