101 citations · 451 across the 77 of their papers we have counts for
4 papers · 1 filter
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits
Siwei Wang, Longbo Huang, John C. S. Lui
We study the online restless bandit problem, where the state of each arm evolves according to a Markov chain, and the reward of pulling an arm depends on both the pulled arm and th…
Online VNF Chaining and Predictive Scheduling: Optimality and Trade-offs
Xi Huang, Simeng Bian, Xin Gao +4
For NFV systems, the key design space includes the function chaining for network requests and resource scheduling for servers. The problem is challenging since NFV systems usually…
Online Competitive Influence Maximization
Jinhang Zuo, Xutong Liu, Carlee Joe-Wong +2
Online influence maximization has attracted much attention as a way to maximize influence spread through a social network while learning the values of unknown network parameters. M…
Combining Offline Causal Inference and Online Bandit Learning for Data Driven Decision
Li Ye, Yishi Lin, Hong Xie +1
A fundamental question for companies with large amount of logged data is: How to use such logged data together with incoming streaming data to make good decisions? Many companies c…