An adapted UCB bandit routing algorithm reaches about 99% of the oracle payoff on a real call center simulation, and a new tree-based heuristic cuts waiting times to benchmark levels.
On learning the cµ rule in single and parallel server networks.2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, pages 153–154, 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Demonstration of effective UCB-based routing in skill-based queues on real-world data
An adapted UCB bandit routing algorithm reaches about 99% of the oracle payoff on a real call center simulation, and a new tree-based heuristic cuts waiting times to benchmark levels.