Yige Hong

According to our database, Yige Hong authored at least 10 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

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

When is exponential asymptotic optimality achievable in average-reward restless bandits?

Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang

CoRR, 2024

Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload.

Isaac Grosof, Yige Hong, Mor Harchol-Balter

CoRR, 2024

Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits.

Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang

CoRR, 2024

2023

Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes.

Yige Hong, Qiaomin Xie, Weina Wang

Proc. ACM Meas. Anal. Comput. Syst., December, 2023

The RESET and MARC techniques, with application to multiserver-job analysis.

Isaac Grosof, Yige Hong, Mor Harchol-Balter, Alan Scheller-Wolf

Perform. Evaluation, November, 2023

Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption.

Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Sharp Zero-Queueing Bounds for Multi-Server Jobs.

Yige Hong

SIGMETRICS Perform. Evaluation Rev., 2022

Maximizing Utilization under Time-Varying Resource Requirements.

Yige Hong, Qiaomin Xie, Weina Wang

CoRR, 2022

Sharp waiting-time bounds for multiserver jobs.

Yige Hong, Weina Wang

Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022