4 citations · 7 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023★ 3 cited
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…
cs.DS2020
Adwords in a Panorama
Zhiyi Huang, Qiankun Zhang, Yuhao Zhang
Three decades ago, Karp, Vazirani, and Vazirani (STOC 1990) defined the online matching problem and gave an optimal -competitive algorithm. Fifteen yea…
cs.DS2020★ 4 cited
Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue
Zhiyi Huang, Qiankun Zhang
Mehta and Panigrahi (FOCS 2012) introduce the problem of online matching with stochastic rewards, where edges are associated with success probabilities and a match succeeds with th…