Hi, hope you have a great day!

I am a fifth year Ph.D. student in the Department of Industrial Engineering and Operations Research Department at Columbia University, where I am fortunate to be advised by Professor Yuri Faenza and Professor Jay Sethuraman.

My research focuses on matching markets and mechanism design, studied from both theoretical and applied perspectives. In particular, I have worked on problems related to:

• Stable matchings.
• School choice.
• Kidney exchange programs.
• Strategic behaviors and strategyproofness.

More broadly, I am also interested in discrete optimization, algorithmic game theory, algorithmic complexity (in particular, the complexity of linear programming and fixed-point computation) and online resource allocation. Before joining Columbia IEOR, I obtained my Bachelor’s degree in Mathematics from Zhejiang University.

Recent News

• October 2025: I host a session “Optimization and Strategic Issue in Matching Markets” at INFORMS Annual Meeting at Atlanta.
• September 2025: Our work “Minimum Cut Representability of Stable Matching Problems” has been awarded honorable mention in the INFORMS Optimization Society’s 2025 Student Paper Prize!
• July 2025: I give a talk at ICALP 2025 on our paper “Scarf’s Algorithm on Arborescence Hypergraphs”.
• May 2025: Our paper “Scarf’s Algorithm and Stable Marriages” has been accepted for publication on Mathematics of Operations Research.