{"total":37,"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":"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,"area":null},{"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,"area":null},{"id":"2202.07511","title":"Pessimistic Minimax Value Iteration: Provably Efficient Equilibrium Learning from Offline Datasets","created":"2022-02-15","cited_by_count":44,"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":"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":"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,"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":"2111.11743","title":"Independent Learning in Stochastic Games","created":"2021-11-23","cited_by_count":22,"area":null},{"id":"2305.18258","title":"Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration","created":"2023-05-29","cited_by_count":20,"area":null},{"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":"2210.01907","title":"A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games","created":"2022-10-04","cited_by_count":16,"area":null},{"id":"2210.16976","title":"Representation Learning for General-sum Low-rank Markov Games","created":"2022-10-30","cited_by_count":15,"area":null},{"id":"2203.07322","title":"Efficient Model-based Multi-agent Reinforcement Learning via Optimistic Equilibrium Computation","created":"2022-03-14","cited_by_count":14,"area":null},{"id":"2305.11283","title":"On the Statistical Efficiency of Mean-Field Reinforcement Learning with General Function Approximation","created":"2023-05-18","cited_by_count":14,"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":"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":"2302.01477","title":"A Reduction-based Framework for Sequential Decision Making with Delayed Feedback","created":"2023-02-03","cited_by_count":7,"area":null},{"id":"2406.06823","title":"Locally Interdependent Multi-Agent MDP: Theoretical Framework for Decentralized Agents with Dynamic Dependencies","created":"2024-06-10","cited_by_count":6,"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":"2207.08894","title":"A Deep Reinforcement Learning Approach for Finding Non-Exploitable Strategies in Two-Player Atari Games","created":"2022-07-18","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":"2310.19861","title":"Posterior Sampling for Competitive RL: Function Approximation and Partial Observation","created":"2023-10-30","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":"2404.19292","title":"Provably Efficient Information-Directed Sampling Algorithms for Multi-Agent Reinforcement Learning","created":"2024-04-30","cited_by_count":2,"area":null},{"id":"2106.07203","title":"Online Sub-Sampling for Reinforcement Learning with General Function Approximation","created":"2021-06-14","cited_by_count":1,"area":null},{"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":"2410.09701","title":"Transformers as Game Players: Provable In-context Game-playing Capabilities of Pre-trained Models","created":"2024-10-13","cited_by_count":1,"area":null},{"id":"2303.09716","title":"A New Policy Iteration Algorithm For Reinforcement Learning in Zero-Sum Markov Games","created":"2023-03-17","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":"2403.11544","title":"RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model","created":"2024-03-18","cited_by_count":0,"area":null},{"id":"2606.02363","title":"Minimax-Optimal Policy Regret in Partially Observable Markov Games","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}