{"total":22,"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":"2209.14990","title":"Partially Observable RL with B-Stability: Unified Structural Condition and Sharp Sample-Efficient Algorithms","created":"2022-09-29","cited_by_count":24,"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":"2306.16884","title":"Policy Space Diversity for Non-Transitive Games","created":"2023-06-29","cited_by_count":15,"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":"2205.07223","title":"Sample-Efficient Learning of Correlated Equilibria in Extensive-Form Games","created":"2022-05-15","cited_by_count":7,"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":"2208.09747","title":"Near-Optimal $\\Phi$-Regret Learning in Extensive-Form Games","created":"2022-08-20","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":"2309.00656","title":"Local and adaptive mirror descents in extensive-form games","created":"2023-09-01","cited_by_count":2,"area":null},{"id":"2410.23398","title":"On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games","created":"2024-10-30","cited_by_count":2,"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":"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":"2605.05266","title":"Differential Privacy in the Extensive-Form Bandit Problem","created":"2026-05-06","cited_by_count":1,"area":null},{"id":"2210.11402","title":"Learning Rationalizable Equilibria in Multiplayer Games","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2406.04201","title":"Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2508.06443","title":"The Fair Game: Auditing & Debiasing AI Algorithms Over Time","created":"2025-08-08","cited_by_count":0,"area":null},{"id":"2605.04979","title":"On-line Learning in Tree MDPs by Treating Policies as Bandit Arms","created":"2026-05-06","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}