24 citations · 163 across the 39 of their papers we have counts for
43 papers
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…
Strong Revenue (Non-)Monotonicity of Single-parameter Auctions
Ziyun Chen, Zhiyi Huang, Dorsa Majdi +1
Consider Myerson's optimal auction with respect to an inaccurate prior, e.g., estimated from data, which is an underestimation of the true value distribution. Can the auctioneer ex…
Class Fairness in Online Matching
Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi +1
In the classical version of online bipartite matching, there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that arrive online. When each i…
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…