conftrace_

multi-agent bandit

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (4) multi-armed bandit (4) multi-agent system (2) regret minimization (2) distributed learning (2) sample complexity (2) ad hoc teamwork (1) information exchange (1) general-sum game (1) communication strategy (1)

Papers

Multi-agent Multi-armed Bandit Regret Complexity and Optimality AISTATS 2025 A near-optimal high-probability swap-Regret upper bound for multi-agent bandits in unknown general-sum games UAI 2023 Best Arm Identification in Multi-Agent Multi-Armed Bandits ICML 2023 Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits? UAI 2023 An α-No-Regret Algorithm For Graphical Bilinear Bandits NeurIPS 2022 Near-Optimal Collaborative Learning in Bandits NeurIPS 2022 Queue Up Your Regrets: Achieving the Dynamic Capacity Region of Multiplayer Bandits NeurIPS 2022 Decentralized Multi-Agent Linear Bandits with Safety Constraints AAAI 2021 Cooperative Multi-Agent Bandits with Heavy Tails ICML 2020 The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits AISTATS 2020 Coordinated Versus Decentralized Exploration In Multi-Agent Multi-Armed Bandits IJCAI 2017