Recipient of the NSF CAREER award, the Arthur L. Samuel best doctoral thesis award, and the ACM EC best student paper award. Published numerous research papers including 'Optimal Stopping vs Best-of-N for Inference Time Optimization' (in submission), 'Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems' (in submission), etc.
Research Experience
Associate Professor at the Department of Computer Science, USC, where he is a member of the Theory Group. His research spans developing new algorithmic techniques and understanding their power and limitations across various domains.
Education
Received a B.S. in computer science, summa cum laude, from Cornell University in 2004; Ph.D. in computer science from Stanford University in 2011.
Background
Associate Professor in the Department of Computer Science at USC, member of the Theory Group. Broadly interested in game theory, mechanism design, multi-agent systems, persuasion and information design, delegation and contract theory, decision making under online or stochastic uncertainty, and the theory of machine learning.