arXiv Machine Learning
Aug 13

DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks

arXiv:2608. 11873v1 Announce Type: new Abstract: In this work, we extend the Dependent Click Model (DCM) Bandits to a multiplayer information-asymmetric setting, where multiple agents interact with a shared ranked list and may observe multiple clicks per session, introducing new challenges for selection strategies.

By Andy Wang, Charlton Shih, William Chang