Introduces P2MLE-UCB and GP2-UCB round-based algorithms achieving optimal regret bounds for multiplicative and general position-aware MNL bandits, with efficient optimization subroutines.
ACM Transactions on Information Systems 41(3):1--39
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning in Position-Aware Multinomial Logit Bandits: From Multiplicative to General Position Effects
Introduces P2MLE-UCB and GP2-UCB round-based algorithms achieving optimal regret bounds for multiplicative and general position-aware MNL bandits, with efficient optimization subroutines.