Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry
This work develops robust decentralized algorithms for each setting and derive regret guarantees that nearly match centralized heavy-tailed rates.
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
This work develops robust decentralized algorithms for each setting and derive regret guarantees that nearly match centralized heavy-tailed rates.
We study the multiplayer multi-armed bandit problem with information asymmetry under Bernoulli rewards, for three information structures: asymmetry in actions, in rewards, and in both. Replacing the Hoeffding-style confidence intervals of prior work with Kullback--Leibler (KL) divergence-based bounds gives strictly tig...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.