Aviad Rubinstein

Aviad Rubinstein is an Assistant Professor of Computer Science at Stanford University, specializing in theoretical computer science with a focus on algorithms, complexity, and game theory. He has taught courses such as Design and Analysis of Algorithms (CS161), Incentives in Computer Science (CS269i), and Topics in Intractability (CS354). His research interests include approximation algorithms, computational complexity, and fair division, with notable work on envy-free cake-cutting and prophet inequalities.

He advises several PhD students including Joshua Brakensiek and Ruiquan Gao, and mentors postdocs like Soheil Behnezhad. His undergraduate mentoring includes students from Tsinghua and Berkeley. Rubinstein has received the Kalai Prize from the Game Theory Society and a FOCS Best Paper Award for his work on inapproximability of Nash equilibria.

Rubinstein co-authored Algorithms for Toddlers with Mary Wootters, a book simplifying computational concepts for younger audiences. He also organizes workshops on topics like fine-grained complexity and early career mentoring in computer science. Beyond academia, he consults part-time for the blockchain startup Lava.

His research frequently bridges theoretical foundations with practical implications, such as developing algorithms with real-world applications in auctions, mechanism design, and optimization under constraints.