A new multiplayer formulation of Dependent Click Model bandits with action and reward asymmetry, three decentralized algorithms, and sublinear regret guarantees.
Efficient multiple-click models in web search,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks
A new multiplayer formulation of Dependent Click Model bandits with action and reward asymmetry, three decentralized algorithms, and sublinear regret guarantees.