Follow
Zhiyi Huang
Title
Cited by
Cited by
Year
Online auctions in IaaS clouds: welfare and profit maximization with server costs
X Zhang, Z Huang, C Wu, Z Li, F Lau
IEEE/ACM Transactions on Networking (ToN) 25 (2), 1034 - 1047, 2016
1322016
Making the most of your samples
Z Huang, Y Mansour, T Roughgarden
SIAM Journal on Computing (SICOMP) 47 (3), 651-674, 2018
1222018
The sample complexity of auctions with side information
NR Devanur, Z Huang, CA Psomas
48th Annual ACM Symposium on Theory of Computing (STOC), 426-439, 2016
962016
The exponential mechanism for social welfare: private, truthful, and nearly optimal
Z Huang, S Kannan
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 140-149, 2012
892012
Bayesian incentive compatibility via fractional assignments
X Bei, Z Huang
22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 720-733, 2011
802011
Private matchings and allocations
J Hsu, Z Huang, A Roth, T Roughgarden, ZS Wu
SIAM Journal on Computing (SICOMP) 45 (6), 1953–1984, 2016
772016
How to match when all vertices arrive online
Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu
50th Annual ACM Symposium on Theory of Computing (STOC), 17-29, 2018
752018
An efficient cloud market mechanism for computing jobs with soft deadlines
R Zhou, Z Li, C Wu, Z Huang
IEEE/ACM Transactions on Networking (ToN) 25 (2), 793-805, 2017
712017
Primal dual gives almost optimal energy efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 2018
702018
Simple and nearly optimal multi-item auctions
Y Cai, Z Huang
24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 564-577, 2013
622013
Online algorithms for covering and packing problems with convex objectives
Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ...
57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 148-157, 2016
60*2016
Online vertex-weighted bipartite matching: beating 1-1/e with random arrivals
Z Huang, ZG Tang, X Wu, Y Zhang
ACM Transactions on Algorithms (TALG) 15 (3), 38, 2019
582019
Whole-page optimization and submodular welfare maximization with online bidders
NR Devanur, Z Huang, N Korula, VS Mirrokni, Q Yan
ACM Transactions on Economics and Computation (TEAC) 4 (3), 2016
552016
Tight competitive ratios of classic matching algorithms in the fully online model
Z Huang, B Peng, ZG Tang, R Tao, X Wu, Y Zhang
30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2875-2886, 2019
542019
Welfare maximization with production costs: a primal dual approach
Z Huang, A Kim
26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 59-72, 2015
54*2015
Multi-scale online learning: theory and applications to online auctions and pricing
S Bubeck, N Devanur, Z Huang, R Niazadeh
Journal of Machine Learning Research (JMLR) 20 (62), 2019
51*2019
Edge-weighted online bipartite matching
M Fahrbach, Z Huang, R Tao, M Zadimoghaddam
61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2020
44*2020
Learning resource allocation and pricing for cloud profit maximization
B Du, C Wu, Z Huang
33rd AAAI Conference on Artificial Intelligence (AAAI), 2019
382019
Online stochastic buy-sell mechanism for VNF chains in the NFV market
X Zhang, Z Huang, C Wu, Z Li, FCM Lau
IEEE Journal on Selected Areas in Communications (JSAC) 35 (2), 392-406, 2017
382017
Jointly private convex programming
J Hsu, Z Huang, A Roth, ZS Wu
27nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 580-599, 2016
382016
The system can't perform the operation now. Try again later.
Articles 1–20