Yuhao Li (李毓浩)

Yuhao Li

I am a second-year (2021-present) PhD student in the theory group of Computer Science Department, Columbia University. I am extremely fortunate to be advised by Prof. Xi Chen and Prof. Rocco Servedio.

My research interests broadly lie in theoretical computer science, especially algorithms and complexity theory related to TFNP, proof complexity, communication complexity, and property testing.

I visited Simons Institute (UC Berkerley) in Spring 2023 for the Meta-Complexity program. I got the B.Sc. degree in computer science from Peking University, where I worked with Prof. Xiaotie Deng on algorithmic game theory.



  • Reducing Tarski to Unique Tarski (in the Black-box Model) (ECCC)
  • 2022

  • Optimal Private Payoff Manipulation against Commitment in Extensive-form Games (arXiv)
  • Insightful Mining Equilibria (arXiv)
  • Improved Upper Bounds for Finding Tarski Fixed Points (arXiv, EC)
  • Tight Incentive Analysis on Sybil Attacks to Market Equilibrium of Resource Exchange over General Networks (PDF, EC)
  • 2021

  • On Tightness of the Tsaknakis-Spirakis Algorithm for Approximate Nash Equilibrium (arXiv, SAGT, I&C)
  • 2020

  • Limiting the Deviation Incentives in Resource Sharing Networks (AAMAS, APJOR)
  • Tightening up the incentive ratio for resource sharing over the rings (IPDPS)
  • Preprints

  • Learning to Manipulate a Commitment Optimizer (arXiv)
  • Contact

    Last updated: 15 May, 2023