22 citations · 28 across the 10 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LG2020★ 1 cited
A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit
Priyank Agrawal, Theja Tulabandhula, Vashist Avadhanula
In this paper, we consider the contextual variant of the MNL-Bandit problem. More specifically, we consider a dynamic set optimization problem, where a decision-maker offers a subs…
cs.LG2020
Multi-armed Bandits with Cost Subsidy
Deeksha Sinha, Karthik Abinav Sankararama, Abbas Kazerouni +1
In this paper, we consider a novel variant of the multi-armed bandit (MAB) problem, MAB with cost subsidy, which models many real-life applications where the learning agent has to…