I'm a postdoctoral researcher in Jennifer Chayes's group at Microsoft Research, New England. In July 2009, I'm joining the faculty at EECS, MIT as an assistant professor and member of CSAIL.
Before moving to Boston, I spent four wonderful years as a theory student at U.C. Berkeley, advised by Christos Papadimitriou. I did my undergraduate studies in Electrical and Computer Engineering at the National Technical University of Athens, Greece.
My research focuses on algorithmic game theory, computational biology and applied probability.
Recent News:
Together with Paul Goldberg and Christos Papadimitriou, we received the first Game Theory and Computer Science Prize for our paper "The Complexity of Computing a Nash Equilibrium." The prize is awarded once every four years at the World Congress of the Game Theory Society. The citation reads in part as follows: "This paper made key conceptual and technical contributions in an illustrious line of work on the complexity of computing Nash equilibrium. It also highlights the necessity of constructing practical algorithms that compute equilibria efficiently on important subclasses of games." Here is a report from the congress by Paul.
Here is a simplified exposition of our article on the Complexity of Nash equilibria.
My Ph.D. thesis is here.
I received the Microsoft Research Fellowship in Honor of Dean A. Richard Newton.
Committees: SODA 2008, EC 2009, SAGT 2009.
Link to academic work.