Dr. Zhiyi Huang

PhD Pennsylvania
Associate Professor

Email: zhiyi@cs.hku.hk
Homepage: https://www.cs.hku.hk/~zhiyi

Zhiyi is an Associate Professor of Computer Science at the University of Hong Kong. He works broadly on Theoretical Computer Science and Algorithmic Game Theory, and dabbles in the theoretical aspects of related fields, including Machine Learning, and Computer Networks. Since joining HKU in 2014, Zhiyi has received the Early Career Award from the Research Grant Council of Hong Kong in 2014, and the Best Paper Award of SPAA in 2015. Before joining HKU, he was a postdoc at Stanford University from 2013 to 2014, working with Tim Roughgarden. He obtained his Ph.D. from the University of Pennsylvania under Sampath Kannan and Aaron Roth in 2013, and received the Morris and Dorothy Rubinoff Dissertation Award. Before that, Zhiyi was the recipient of the Simons Graduate Fellowship in Theoretical Computer Science from 2012 to 2013, and interned at Microsoft Research Redmond under Nikhil R. Devanur in the summers of 2011 and 2012. Prior to his Ph.D. studies, Zhiyi graduated from the first "Yao Class" under Andrew Yao at Tsinghua University in 2008.

Research Interests

Theoretical Computer Science, Algorithmic Game Theory, Online Algorithm, Differential Privacy

Selected Publications

  • Chenghao Guo, Zhiyi Huang, Xinzhi Zhang, Settling the Sample Complexity of Single-parameter Revenue Maximization, 51st ACM Annual Symposium on the Theory of Computing (STOC 2019)
  • Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu, How to match when all vertices arrive online, 50th ACM Annual Symposium on the Theory of Computing (STOC 2018)
  • Yossi Azar, Niv Buchbinder, T-H. Hubert Chan, Shahar Chen, Ilan R. Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph (Seffi) Naor, Debmalya Panigrahi, Online algorithms for covering and packing problems with convex objectives, 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016)
  • Nikhil R. Devanur, Zhiyi Huang, Christos-Alexandros Psomas, The sample complexity of auctions with side information, 48th ACM Annual Symposium on the Theory of Computing (STOC 2016)
  • Zhiyi Huang, Yishay Mansour, Tim Roughgarden, Making the most of your samples, 16th ACM Conference on Economics and Computation (EC 2015)
  • Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, and Steven Zhiwei Wu, Private matchings and allocations, STOC 2014
  • Zhiyi Huang and Sampath Kannan, The exponential mechanism for social welfare: private, truthful, and nearly optimal, FOCS 2012
  • Zhiyi Huang, Sampath Kannan, and Sanjeev Khanna, Algorithms for the generalized sorting problem, FOCS 2011
  • Xiaohui Bei and Zhiyi Huang, Bayesian incentive compatibility via fractional assignments, SODA 2011
  • Tanmoy Chakraborty, Zhiyi Huang, and Sanjeev Khanna, Dynamic and non-uniform pricing strategies for revenue maximization, FOCS 2009

Recent Research Grants

  • 2017-2020, Understanding price of anarchy via the duality framework (700,000 HKD), HKU17203717E, Research Grant Council of Hong Kong
  • 2016-2019, The algorithmic and information theoretic foundations of Bayesian mechanism design (675,647 HKD), HKU17257516E, Research Grants Council of Hong Kong
  • 2015-2018, New frontiers of the online primal dual technique: convex programs and limitations of the canonical approach (496,028 HKD), HKU17202115E, Research Grants Council of Hong Kong
  • 2014-2017, Privacy-preserving mechanisms in economic markets (931,737 HKD), HKU27200214E, Research Grants Council of Hong Kong, Early Career Scheme, Recipient of the Early Career Award (22 out of 359)