{"total":120,"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":"2103.05324","title":"A Simple Approach for Non-stationary Linear Bandits","created":"2021-03-09","cited_by_count":54,"area":null},{"id":"2107.08346","title":"Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses","created":"2021-07-18","cited_by_count":52,"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":"2110.05682","title":"Provably Efficient Reinforcement Learning in Decentralized General-Sum Markov Games","created":"2021-10-12","cited_by_count":42,"area":null},{"id":"2210.12529","title":"On-Demand Sampling: Learning Optimally from Multiple Distributions","created":"2022-10-22","cited_by_count":39,"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":"2104.03781","title":"Leveraging Good Representations in Linear Contextual Bandits","created":"2021-04-08","cited_by_count":29,"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":"2201.13172","title":"Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2022-01-31","cited_by_count":22,"area":null},{"id":"2106.06279","title":"Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recall","created":"2021-06-11","cited_by_count":21,"area":null},{"id":"2111.01589","title":"Nonstochastic Bandits and Experts with Arm-Dependent Delays","created":"2021-11-02","cited_by_count":18,"area":null},{"id":"2403.03672","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","created":"2024-03-06","cited_by_count":16,"area":"deeprl"},{"id":"2309.15771","title":"Importance-Weighted Offline Learning Done Right","created":"2023-09-27","cited_by_count":15,"area":"offlinerl"},{"id":"2111.00781","title":"Decentralized Cooperative Reinforcement Learning with Hierarchical Information Structure","created":"2021-11-01","cited_by_count":14,"area":null},{"id":"2103.04550","title":"No Weighted-Regret Learning in Adversarial Bandits with Delays","created":"2021-03-08","cited_by_count":12,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","cited_by_count":12,"area":null},{"id":"2202.04786","title":"No-Regret Learning in Dynamic Stackelberg Games","created":"2022-02-10","cited_by_count":12,"area":null},{"id":"2206.14912","title":"Best of Both Worlds Model Selection","created":"2022-06-29","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":"2302.08631","title":"Practical Contextual Bandits with Feedback Graphs","created":"2023-02-17","cited_by_count":11,"area":null},{"id":"2308.10675","title":"A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays","created":"2023-08-21","cited_by_count":11,"area":null},{"id":"2403.03562","title":"Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond","created":"2024-03-06","cited_by_count":11,"area":null},{"id":"1901.11221","title":"Contextual Multi-armed Bandit Algorithm for Semiparametric Reward Model","created":"2019-01-31","cited_by_count":10,"area":"alignment"},{"id":"2402.01845","title":"Multi-Armed Bandits with Interference","created":"2024-02-02","cited_by_count":10,"area":null},{"id":"2405.16118","title":"Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints","created":"2024-05-25","cited_by_count":10,"area":null},{"id":"2404.09832","title":"No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints","created":"2024-04-15","cited_by_count":9,"area":null},{"id":"2107.03455","title":"Model Selection for Generic Contextual Bandits","created":"2021-07-07","cited_by_count":8,"area":null},{"id":"2305.19036","title":"Delayed Bandits: When Do Intermediate Observations Help?","created":"2023-05-30","cited_by_count":8,"area":null},{"id":"2307.02295","title":"Meta-Learning Adversarial Bandit Algorithms","created":"2023-07-05","cited_by_count":8,"area":null},{"id":"2402.12673","title":"Beyond Worst-case Attacks: Robust RL with Adaptive Defense via Non-dominated Policies","created":"2024-02-20","cited_by_count":8,"area":"deeprl"},{"id":"2310.16252","title":"Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits","created":"2023-10-25","cited_by_count":7,"area":null},{"id":"2305.07911","title":"Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2023-05-13","cited_by_count":6,"area":null},{"id":"2305.12795","title":"Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments","created":"2023-05-22","cited_by_count":6,"area":null},{"id":"2306.08470","title":"Bandits with Replenishable Knapsacks: the Best of both Worlds","created":"2023-06-14","cited_by_count":6,"area":null},{"id":"2307.12897","title":"Anytime Model Selection in Linear Bandits","created":"2023-07-24","cited_by_count":6,"area":null},{"id":"2402.08127","title":"Efficient Contextual Bandits with Uninformed Feedback Graphs","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2403.04568","title":"Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition","created":"2024-03-07","cited_by_count":6,"area":"deeprl"},{"id":"2404.05318","title":"Stochastic Online Optimization for Cyber-Physical and Robotic Systems","created":"2024-04-08","cited_by_count":6,"area":null},{"id":"2405.06575","title":"No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization","created":"2024-05-10","cited_by_count":6,"area":null},{"id":"2504.00461","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries","created":"2025-04-01","cited_by_count":6,"area":null},{"id":"2205.14128","title":"Meta-Learning Adversarial Bandits","created":"2022-05-27","cited_by_count":5,"area":null},{"id":"2206.09348","title":"Nested bandits","created":"2022-06-19","cited_by_count":5,"area":null},{"id":"2210.01376","title":"Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs","created":"2022-10-04","cited_by_count":5,"area":null},{"id":"2302.01203","title":"Online Learning under Budget and ROI Constraints via Weak Adaptivity","created":"2023-02-02","cited_by_count":5,"area":null},{"id":"2302.07186","title":"Adversarial Rewards in Universal Learning for Contextual Bandits","created":"2023-02-14","cited_by_count":5,"area":"alignment"},{"id":"2405.14372","title":"Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints","created":"2024-05-23","cited_by_count":5,"area":"deeprl"},{"id":"2410.00690","title":"Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity","created":"2024-10-01","cited_by_count":5,"area":null},{"id":"2506.13244","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","created":"2025-06-16","cited_by_count":5,"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":"2106.13539","title":"Dealing with Expert Bias in Collective Decision-Making","created":"2021-06-25","cited_by_count":4,"area":null},{"id":"2201.13170","title":"Cooperative Online Learning in Stochastic and Adversarial MDPs","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2207.06030","title":"Contextual Active Model Selection","created":"2022-07-13","cited_by_count":4,"area":null},{"id":"2207.08956","title":"Online Learning with Off-Policy Feedback","created":"2022-07-18","cited_by_count":4,"area":null},{"id":"2302.04374","title":"Near-Optimal Adversarial Reinforcement Learning with Switching Costs","created":"2023-02-08","cited_by_count":4,"area":null},{"id":"2302.09267","title":"Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond","created":"2023-02-18","cited_by_count":4,"area":null},{"id":"2306.09588","title":"Understanding the Role of Feedback in Online Learning with Switching Costs","created":"2023-06-16","cited_by_count":4,"area":null},{"id":"2402.10282","title":"Information Capacity Regret Bounds for Bandits with Mediator Feedback","created":"2024-02-15","cited_by_count":4,"area":null},{"id":"2602.21436","title":"Efficient Uncoupled Learning Dynamics with $\\tilde{O}\\!\\left(T^{-1/4}\\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback","created":"2026-02-24","cited_by_count":4,"area":null},{"id":"2207.09090","title":"Actor-Critic based Improper Reinforcement Learning","created":"2022-07-19","cited_by_count":3,"area":null},{"id":"2305.01063","title":"Expertise Trees Resolve Knowledge Limitations in Collective Decision-Making","created":"2023-05-02","cited_by_count":3,"area":null},{"id":"2307.15193","title":"Learning in Repeated Multi-Unit Pay-As-Bid Auctions","created":"2023-07-27","cited_by_count":3,"area":null},{"id":"2403.01315","title":"Near-optimal Per-Action Regret Bounds for Sleeping Bandits","created":"2024-03-02","cited_by_count":3,"area":null},{"id":"2503.14796","title":"A New Benchmark for Online Learning with Budget-Balancing Constraints","created":"2025-03-19","cited_by_count":3,"area":null},{"id":"2105.13939","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems","created":"2021-05-28","cited_by_count":2,"area":null},{"id":"2209.07148","title":"Semi-supervised Batch Learning From Logged Data","created":"2022-09-15","cited_by_count":2,"area":null},{"id":"2210.02256","title":"Constant regret for sequence prediction with limited advice","created":"2022-10-05","cited_by_count":2,"area":null},{"id":"2301.00241","title":"Contextual Bandits and Optimistically Universal Learning","created":"2022-12-31","cited_by_count":2,"area":null},{"id":"2309.16563","title":"CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption","created":"2023-09-28","cited_by_count":2,"area":null},{"id":"2403.00930","title":"Scale-free Adversarial Reinforcement Learning","created":"2024-03-01","cited_by_count":2,"area":"deeprl"},{"id":"2503.03195","title":"Online Bidding under RoS Constraints without Knowing the Value","created":"2025-03-05","cited_by_count":2,"area":null},{"id":"2505.15212","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2505.20010","title":"Data-Dependent Regret Bounds for Constrained MABs","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2510.17103","title":"Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback","created":"2025-10-20","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":"2211.03285","title":"SLOPT: Bandit Optimization Framework for Mutation-Based Fuzzing","created":"2022-11-07","cited_by_count":1,"area":null},{"id":"2312.01587","title":"Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains","created":"2023-12-04","cited_by_count":1,"area":null},{"id":"2402.09456","title":"Optimistic Thompson Sampling for No-Regret Learning in Unknown Games","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2405.00950","title":"Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback","created":"2024-05-02","cited_by_count":1,"area":"deeprl"},{"id":"2405.02188","title":"Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes","created":"2024-05-03","cited_by_count":1,"area":null},{"id":"2502.04678","title":"Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback","created":"2025-02-07","cited_by_count":1,"area":null},{"id":"2506.14518","title":"Two-Player Zero-Sum Games with Bandit Feedback","created":"2025-06-17","cited_by_count":1,"area":null},{"id":"2509.20114","title":"Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints","created":"2025-09-24","cited_by_count":1,"area":"deeprl"},{"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":"2602.07418","title":"Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses","created":"2026-02-07","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":"2609.34656","title":"Minimax Last-Iterate Convergence in Matrix Games with Observed Actions","created":"2026-09-28","cited_by_count":1,"area":null},{"id":"2102.05164","title":"Nonstochastic Bandits with Infinitely Many Experts","created":"2021-02-09","cited_by_count":0,"area":null},{"id":"2102.08201","title":"Improper Reinforcement Learning with Gradient-based Policy Optimization","created":"2021-02-16","cited_by_count":0,"area":null},{"id":"2104.12827","title":"Learning-based decentralized offloading decision making in an adversarial environment","created":"2021-04-26","cited_by_count":0,"area":null},{"id":"2111.05486","title":"Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms","created":"2021-11-10","cited_by_count":0,"area":null},{"id":"2206.02036","title":"Interpolating Between Softmax Policy Gradient and Neural Replicator Dynamics with Capped Implicit Exploration","created":"2022-06-04","cited_by_count":0,"area":null},{"id":"2210.11402","title":"Learning Rationalizable Equilibria in Multiplayer Games","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2302.09451","title":"Estimating Optimal Policy Value in General Linear Contextual Bandits","created":"2023-02-19","cited_by_count":0,"area":null},{"id":"2304.00999","title":"Bandits for Sponsored Search Auctions under Unknown Valuation Model: Case Study in E-Commerce Advertising","created":"2023-03-31","cited_by_count":0,"area":null},{"id":"2309.16161","title":"Leveraging Untrustworthy Commands for Multi-Robot Coordination in Unpredictable Environments: A Bandit Submodular Maximization Approach","created":"2023-09-28","cited_by_count":0,"area":null}],"next_cursor":"100"}