A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Congested Bandits: Optimal Routing via Short-term Resets
2022
International Conference on Machine Learning
For traffic routing platforms, the choice of which route to recommend to a user depends on the congestion on these routes -indeed, an individual's utility depends on the number of people using the recommended route at that instance. Motivated by this, we introduce the problem of Congested Bandits where each arm's reward is allowed to depend on the number of times it was played in the past ∆ timesteps. This dependence on past history of actions leads to a dynamical system where an algorithm's
dblp:conf/icml/AwasthiBGK22
fatcat:6lwb7y4f6zetzigdfledissu7m