Zhiyi Huang


Department of Computer and Information Science
University of Pennsylvania
3330 Walnut Street, GRW 561
Philadelphia, PA 19104

Email: hzhiyi AT cis DOT upenn DOT edu


(Last update on February 8, 2012)

About Me

I am a 4th-year PhD student in the CIS department at Penn. I am very fortunate to have Prof. Sampath Kannan as my advisor. Before I came to US, I took undergraduate study in the Microsoft Special Pilot CS Class under Prof. Andrew Yao at Tsinghua University. During high school, I became very interested in mathematics and won some MO medals in 2004.

My research interests in general are algorithms and computational complexity, mainly focusing on algorithmic game theory. My current research is listed below:

  • Blackbox reductions in algorithmic mechanism design
  • Revenue optimal multi-item auctions
  • Differentially private and truthful mechanisms
Here is my cv


Publications

  1. Algorithms for the generalized sorting problem
    with Sampath Kannan and Sanjeev Khanna
    In FOCS 2011. [pdf] [slides]

  2. Bayesian incentive compatibility via fractional assignments
    with Xiaohui Bei
    In SODA 2011. [pdf] [arXiv] [slides]
    Invited talk in China Theory Week 2010. [slides]

  3. Black-box reduction in mechanism design
    with Lei Wang and Yuan Zhou
    In APPROX 2011. [pdf]

  4. On sampling from multivariate distribution
    with Sampath Kannan
    In RANDOM 2011. [pdf]

  5. Dynamic and non-uniform pricing strategies for revenue maximization
    with Tanmoy Chakraborty and Sanjeev Khanna
    In FOCS 2009. [pdf] [arXiv] [slides]
    Journal version to appear in the SIAM Journal on Computing, special issue for FOCS 2009.

  6. Revisiting the direct sum theorem and space lower bounds in random order streams
    with Sudipto Guha
    In ICALP 2009. [pdf]

  7. Reconstructing numbers from pairwise function values
    with Shiteng Chen and Sampath Kannan
    Invited to Algorithmica, spcial issue for ISAAC 2009.
    In ISAAC 2009. [pdf]


Manuscripts

  1. Exponential mechanism for social welfare: private, truthful, and nearly optimal
    with Sampath Kannan
    In submission, 2011. [pdf]

  2. Simple and nearly optimal multi-item auction
    with Yang Cai
    In submission, 2011.

  3. Sequential auctions of identical items with budget-constrained bidders
    with Nikhil R. Devanur and David Malec
    In submission, 2012.

  4. Testing coverage functions
    with Deeparnab Chakrabarty
    In submission, 2011


Trivia



Links