14 citations · 37 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 4 cited
Risk-Averse Explore-Then-Commit Algorithms for Finite-Time Bandits
Ali Yekkehkhany, Ebrahim Arian, Mohammad Hajiesmaili +1
In this paper, we study multi-armed bandit problems in explore-then-commit setting. In our proposed explore-then-commit setting, the goal is to identify the best arm after a pure e…
cs.PF2019
Blind GB-PANDAS: A Blind Throughput-Optimal Load Balancing Algorithm for Affinity Scheduling
Ali Yekkehkhany, Rakesh Nagi
Dynamic affinity load balancing of multi-type tasks on multi-skilled servers, when the service rate of each task type on each of the servers is known and can possibly be different…