{"total":32,"rows":[{"id":"2102.13101","title":"Federated Multi-armed Bandits with Personalization","created":"2021-02-25","cited_by_count":62,"area":null},{"id":"2110.14177","title":"Federated Linear Contextual Bandits","created":"2021-10-27","cited_by_count":61,"area":null},{"id":"2101.12204","title":"Federated Multi-Armed Bandits","created":"2021-01-28","cited_by_count":59,"area":null},{"id":"2207.03106","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits","created":"2022-07-07","cited_by_count":28,"area":null},{"id":"2103.04972","title":"Provably Efficient Cooperative Multi-Agent Reinforcement Learning with Function Approximation","created":"2021-03-08","cited_by_count":23,"area":null},{"id":"2211.16275","title":"A survey on multi-player bandits","created":"2022-11-29","cited_by_count":19,"area":null},{"id":"2111.12482","title":"One More Step Towards Reality: Cooperative Bandits with Imperfect Communication","created":"2021-11-24","cited_by_count":15,"area":null},{"id":"2205.13170","title":"Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost","created":"2022-05-26","cited_by_count":13,"area":null},{"id":"2306.05579","title":"Decentralized Randomly Distributed Multi-agent Multi-armed Bandit with Heterogeneous Rewards","created":"2023-06-08","cited_by_count":11,"area":null},{"id":"2205.14174","title":"Private and Byzantine-Proof Cooperative Decision-Making","created":"2022-05-27","cited_by_count":10,"area":null},{"id":"2106.13669","title":"Multi-player Multi-armed Bandits with Collision-Dependent Reward Distributions","created":"2021-06-25","cited_by_count":8,"area":null},{"id":"2110.04396","title":"When to Call Your Neighbor? Strategic Communication in Cooperative Stochastic Bandits","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2211.02212","title":"Distributed Linear Bandits under Communication Constraints","created":"2022-11-04","cited_by_count":8,"area":null},{"id":"2205.04134","title":"Federated Multi-Armed Bandits Under Byzantine Attacks","created":"2022-05-09","cited_by_count":6,"area":null},{"id":"2207.07948","title":"Collaborative Learning in Kernel-based Bandits for Distributed Users","created":"2022-07-16","cited_by_count":6,"area":null},{"id":"2106.04207","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","created":"2021-06-08","cited_by_count":5,"area":null},{"id":"2111.10933","title":"Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits","created":"2021-11-22","cited_by_count":3,"area":null},{"id":"2309.11702","title":"Incentivized Communication for Federated Bandits","created":"2023-09-21","cited_by_count":3,"area":null},{"id":"2310.07320","title":"Byzantine-Resilient Decentralized Multi-Armed Bandits","created":"2023-10-11","cited_by_count":3,"area":null},{"id":"2503.08004","title":"Multiplayer Information Asymmetric Bandits in Metric Spaces","created":"2025-03-11","cited_by_count":3,"area":null},{"id":"2503.08961","title":"Multiplayer Information Asymmetric Contextual Bandits","created":"2025-03-11","cited_by_count":3,"area":null},{"id":"2402.04485","title":"Incentivized Truthful Communication for Federated Bandits","created":"2024-02-07","cited_by_count":2,"area":null},{"id":"2308.08046","title":"Regret Lower Bounds in Multi-agent Multi-armed Bandit","created":"2023-08-15","cited_by_count":1,"area":null},{"id":"2312.16341","title":"Harnessing the Power of Federated Learning in Federated Contextual Bandits","created":"2023-12-26","cited_by_count":1,"area":null},{"id":"2402.04417","title":"Decentralized Blockchain-based Robust Multi-agent Multi-armed Bandit","created":"2024-02-06","cited_by_count":1,"area":null},{"id":"2601.00461","title":"Laplacian Kernelized Bandit","created":"2026-01-01","cited_by_count":1,"area":null},{"id":"2605.06864","title":"Multi-Objective Multi-Agent Bandits: From Learning Efficiency to Fairness Optimization","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2305.19691","title":"Constant or logarithmic regret in asynchronous multiplayer bandits","created":"2023-05-31","cited_by_count":0,"area":null},{"id":"2312.04719","title":"Distributed Optimization via Kernelized Multi-armed Bandits","created":"2023-12-07","cited_by_count":0,"area":null},{"id":"2402.13182","title":"Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness","created":"2024-02-20","cited_by_count":0,"area":null},{"id":"2510.22811","title":"Distributed Multi-Agent Bandits Over Erd\\H{o}s-R\\'enyi Random Networks","created":"2025-10-26","cited_by_count":0,"area":null},{"id":"2605.06202","title":"Bandit Learning in General Open Multi-agent Systems","created":"2026-05-07","cited_by_count":0,"area":null}],"next_cursor":null}