Sharp waiting-time bounds for multiserver jobs. - Yige Hong; Weina Wang 001 (MobiHoc, 2022)

Maximizing Utilization under Time-Varying Resource Requirements. - Yige Hong; Qiaomin Xie; Weina Wang 001 (CoRR, 2022)

Sharp Zero-Queueing Bounds for Multi-Server Jobs. - Yige Hong (SIGMETRICS Perform. Evaluation Rev., 2022)

Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption. - Yige Hong; Qiaomin Xie; Yudong Chen 001; Weina Wang 001 (NeurIPS, 2023)

The RESET and MARC techniques, with application to multiserver-job analysis. - Isaac Grosof; Yige Hong; Mor Harchol-Balter; Alan Scheller-Wolf (Perform. Evaluation, 2023)

Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes. - Yige Hong; Qiaomin Xie; Weina Wang 001 (Proc. ACM Meas. Anal. Comput. Syst., 2023)

Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits. - Yige Hong; Qiaomin Xie; Yudong Chen 001; Weina Wang 001 (CoRR, 2024)

Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload. - Isaac Grosof; Yige Hong; Mor Harchol-Balter (CoRR, 2024)

When is exponential asymptotic optimality achievable in average-reward restless bandits? - Yige Hong; Qiaomin Xie; Yudong Chen 001; Weina Wang 001 (CoRR, 2024)

Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup times. - Yige Hong; Ziv Scully (Perform. Evaluation, 2024)

ID policy (with reassignment) is asymptotically optimal for heterogeneous weakly-coupled MDPs. - Xiangcheng Zhang; Yige Hong; Weina Wang 001 (CoRR, 2025)