{"total":18,"rows":[{"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":"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":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","cited_by_count":21,"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":"2204.09787","title":"Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency","created":"2022-04-20","cited_by_count":16,"area":null},{"id":"2205.15294","title":"Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent","created":"2022-05-30","cited_by_count":15,"area":null},{"id":"2205.07223","title":"Sample-Efficient Learning of Correlated Equilibria in Extensive-Form Games","created":"2022-05-15","cited_by_count":7,"area":null},{"id":"2604.16087","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","created":"2026-04-17","cited_by_count":5,"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":"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":"2306.07465","title":"A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning","created":"2023-06-12","cited_by_count":3,"area":null},{"id":"2502.11673","title":"Best of Both Worlds: Regret Minimization versus Minimax Play","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2203.05920","title":"Generalized Bandit Regret Minimizer Framework in Imperfect Information Extensive-Form Game","created":"2022-03-11","cited_by_count":1,"area":null},{"id":"2405.11746","title":"Configurable Mirror Descent: Towards a Unification of Decision Making","created":"2024-05-20","cited_by_count":1,"area":null},{"id":"2605.05266","title":"Differential Privacy in the Extensive-Form Bandit Problem","created":"2026-05-06","cited_by_count":1,"area":null},{"id":"2207.06492","title":"Approximate Nash Equilibrium Learning for n-Player Markov Games in Dynamic Pricing","created":"2022-07-13","cited_by_count":0,"area":null},{"id":"2608.09501","title":"Tracking the Best Strategy in an Extensive-Form Game","created":"2026-08-10","cited_by_count":0,"area":null}],"next_cursor":null}