Published numerous papers covering a wide range of topics from theoretical computer science to applied mathematics. Specific publications include:
- Adaptive Approximation Schemes for Matching Queues at ACM Symposium on Theory of Computing (STOC), 2025
- Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting at IEEE Symposium on Foundations of Computer Science (FOCS), 2024
- Two-Stage Stochastic Matching and Pricing with Applications to Ride Hailing in Operations Research, 2024
- Improved Online Contention Resolution for Matchings and Applications to the Gig Economy in Mathematics of Operations Research, 2024
- Locality-Aware Graph Rewiring in GNNs at International Conference on Learning Representations (ICLR), 2024
- And more.
Research Experience
Extensive research in various fields including matching problems, online algorithms, graph theory, and machine learning.
Education
No specific educational background information provided.
Background
Professor at Stanford University and Director of the Stanford Center for Computational Market Design. His research interests include Management Science & Engineering, Operations Research, Theoretical Computer Science, etc.
Miscellany
No personal interests or hobbies information provided.