Aviad Rubinstein wins 2017 ACM Doctoral Dissertation Award

CS alumnus Aviad Rubinstein (Ph.D. ‘ 17, advisor: Christos Papadimitriou) is the recipient of the Association for Computing Machinery (ACM) 2017 Doctoral Dissertation Award for his dissertation “Hardness of Approximation Between P and NP.”  In his thesis, Rubinstein established the intractability of the approximate Nash equilibrium problem and several other important problems between P and NP-completeness—an enduring problem in theoretical computer science.  His work was featured in a Quanta Magazine article titled “In Game Theory, No Clear Path to Equilibrium” in July. After graduating, Rubinstein became a Rabin Postdoc at Harvard and will join Stanford as an Assistant Professor in the fall.