24 citations · 163 across the 39 of their papers we have counts for
23 papers · 1 filter
Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs
Zhiyi Huang, Hanrui Jiang, Aocheng Shen +3
Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards, which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani (1990) by assoc…
Online Nash Welfare Maximization Without Predictions
Zhiyi Huang, Minming Li, Xinkai Shu +1
The maximization of Nash welfare, which equals the geometric mean of agents' utilities, is widely studied because it balances efficiency and fairness in resource allocation problem…
Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials
Zhiyi Huang, Hanwen Zhang
The deterministic -server conjecture states that there is a -competitive deterministic algorithm for the -server problem for any metric space. We show that the work functi…
The Power of Multiple Choices in Online Stochastic Matching
Zhiyi Huang, Xinkai Shu, Shuyi Yan
We study the power of multiple choices in online stochastic matching. Despite a long line of research, existing algorithms still only consider two choices of offline neighbors for…
Improved Online Correlated Selection
Ruiquan Gao, Zhongtian He, Zhiyi Huang +3
This paper studies the online correlated selection (OCS) problem. It was introduced by Fahrbach, Huang, Tao, and Zadimoghaddam (2020) to obtain the first edge-weighted online bipar…
Online Stochastic Matching, Poisson Arrivals, and the Natural Linear Program
Zhiyi Huang, Xinkai Shu
We study the online stochastic matching problem. Consider a bipartite graph with offline vertices on one side, and with i.i.d.online vertices on the other side. The offline vertice…