Improved Multiplayer Bandit Algorithm for Bernoulli Rewards

T1Covered by 1 source · first reported by arXiv at 24 Sept, 04:00 UTC

arXiv:2609.26213v1 Announce Type: new Abstract: 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…

science

Sources

• T1Improved Multiplayer Bandit Algorithm for Bernoulli RewardsarXiv24 Sept, 04:00