{"total":20,"rows":[{"id":"2211.16275","title":"A survey on multi-player bandits","created":"2022-11-29","cited_by_count":19,"area":null},{"id":"2205.14174","title":"Private and Byzantine-Proof Cooperative Decision-Making","created":"2022-05-27","cited_by_count":10,"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":"2301.09223","title":"Doubly Adversarial Federated Bandits","created":"2023-01-22","cited_by_count":7,"area":null},{"id":"2302.07446","title":"On-Demand Communication for Asynchronous Multi-Agent Bandits","created":"2023-02-15","cited_by_count":7,"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":"2106.04982","title":"Cooperative Online Learning with Feedback Graphs","created":"2021-06-09","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":"2211.17154","title":"On Regret-optimal Cooperative Nonstochastic Multi-armed Bandits","created":"2022-11-30","cited_by_count":3,"area":null},{"id":"2308.04314","title":"Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs","created":"2023-08-08","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":"2111.12581","title":"Medium Access Control protocol for Collaborative Spectrum Learning in Wireless Networks","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2310.17385","title":"Multitask Online Learning: Listen to the Neighborhood Buzz","created":"2023-10-26","cited_by_count":1,"area":null},{"id":"2409.19092","title":"Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups","created":"2024-09-27","cited_by_count":1,"area":null},{"id":"2410.23867","title":"QuACK: A Multipurpose Queuing Algorithm for Cooperative $k$-Armed Bandits","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2203.00076","title":"Robust Multi-Agent Bandits Over Undirected Graphs","created":"2022-02-28","cited_by_count":0,"area":null},{"id":"2306.04498","title":"Near-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits","created":"2023-06-07","cited_by_count":0,"area":null},{"id":"2306.08670","title":"Simple Opinion Dynamics for No-Regret Learning","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2605.13145","title":"Collaborating in Multi-Armed Bandits with Strategic Agents","created":"2026-05-13","cited_by_count":0,"area":null}],"next_cursor":null}