6 citations · 14 across the 8 of their papers we have counts for
8 papers
Optimality of a Threshold Policy for a Queueing System with One Fast Server and Two Identical Slow Servers
Weina Wang, Taha Ameen, Yudong Chen +3
This paper studies the optimal control problem of a queueing system with three servers: one fast server and two identical slow servers. The two-server version of this problem, with…
Projection-based Lyapunov method for fully heterogeneous weakly-coupled MDPs
Xiangcheng Zhang, Yige Hong, Weina Wang
Heterogeneity poses a fundamental challenge for many real-world large-scale decision-making problems but remains largely understudied. In this paper, we study the fully heterogeneo…
Achieving Exponential Asymptotic Optimality in Average-Reward Restless Bandits without Global Attractor Assumption
Yige Hong, Qiaomin Xie, Yudong Chen +1
We consider the infinite-horizon average-reward restless bandit problem. We propose a novel \emph{two-set policy} that maintains two dynamic subsets of arms: one subset of arms has…
Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits
Yige Hong, Qiaomin Xie, Yudong Chen +1
We consider the infinite-horizon, average-reward restless bandit problem in discrete time. We propose a new class of policies that are designed to drive a progressively larger subs…
Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption
Yige Hong, Qiaomin Xie, Yudong Chen +1
We study the infinite-horizon restless bandit problem with the average reward criterion, in both discrete-time and continuous-time settings. A fundamental goal is to efficiently co…
Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times
Yige Hong, Ziv Scully
How should we schedule jobs to minimize mean queue length? In the preemptive M/G/1 queue, we know the optimal policy is the Gittins policy, which uses any available information abo…
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes
Yige Hong, Qiaomin Xie, Weina Wang
In modern computing systems, jobs' resource requirements often vary over time. Accounting for this temporal variability during job scheduling is essential for meeting performance g…
Sharp Waiting-Time Bounds for Multiserver Jobs
Yige Hong, Weina Wang
Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today's computing clusters. But little is known about the delay perfor…