Showing 2023Show all
2 papers · 1 filter
cs.LG2023
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs
Tianyuan Jin, Hao-Lun Hsu, William Chang +1
We study the multi-agent multi-armed bandit (MAMAB) problem, where agents are factored into overlapping groups. Each group represents a hyperedge, forming a hypergraph over…
cs.LG2023
Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication
William Chang, Yuanhao Lu
We consider a cooperative multiplayer bandit learning problem where the players are only allowed to agree on a strategy beforehand, but cannot communicate during the learning proce…