Constantinos Daskalakis

Constantinos Daskalakis
Κωνσταντίνος Δασκαλάκης
Constantinos Daskalakis in 2014
Born	29 April 1981 (1981-04-29) (age 42) Athens, Greece
Education	Varvakeio High School National Technical University of Athens (MEng) University of California, Berkeley (PhD)
Known for	Research on the computational complexity of the Nash equilibrium
Awards	Grace Murray Hopper Award (2018) Nevanlinna Prize (2018) Simons Foundation Investigator Award (2018) Sloan Fellowship (2010) ACM Dissertation Award (2008) Kalai Prize (2008)
Scientific career
Fields	Theoretical computer science Economics Probability theory Learning Statistics[1]
Institutions	Massachusetts Institute of Technology Microsoft Research
Thesis	The Complexity of Nash Equilibria (2008)
Doctoral advisor	Christos Papadimitriou[2]
Website	people.csail.mit.edu/costis/

Constantinos Daskalakis (Greek: Κωνσταντίνος Δασκαλάκης; born 29 April 1981) is a Greek theoretical computer scientist.^[1] He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science and Artificial Intelligence Laboratory.^[3][4][5] He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.

Early life and education

Daskalakis was born in Athens on 29 April 1981.^[6] His grandparents originated from Crete, where he summered as a child. He has a younger brother, Nikolaos. When Daskalakis was in third grade, his father bought an Amstrad CPC, which Daskalakis stayed up all night with, attempting to learn how it worked.^[7]

He attended Varvakeio High School, and completed his undergraduate studies in the National Technical University of Athens, where in 2004 he received his Diploma in Electrical and Computer Engineering. He completed his undergraduate thesis "On the Existence of Pure Nash Equilibria in Graphical Games with succinct description" under the supervision of Stathis Zachos. As an undergraduate, Daskalakis attained perfect scores in all but one of his classes, something which had not previously been achieved in the university's history.^[7]

He continued to study at University of California, Berkeley, where he received his PhD in Electrical Engineering and Computer Science in 2008 under the supervision of Christos Papadimitriou.^[2] His thesis was awarded the 2008 ACM Doctoral Dissertation Award.

Research and career

After his PhD he spent a year as a postdoctoral researcher in Jennifer Chayes's group at Microsoft Research, New England.

Daskalakis works on the theory of computation and its interface with game theory, economics, probability theory, statistics and machine learning.^[1]

He has resolved long-standing open problems about the computational complexity of the Nash equilibrium, the mathematical structure and computational complexity of multi-item auctions, and the behavior of machine-learning methods such as the expectation–maximization algorithm. He has obtained computationally and statistically efficient methods for statistical hypothesis testing and learning in high-dimensional settings, as well as results characterizing the structure and concentration properties of high-dimensional distributions.

Daskalakis co-authored The Complexity of Computing a Nash Equilibrium^[8] with his doctoral advisor Christos Papadimitriou and Paul W. Goldberg, for which they received the 2008 Kalai Game Theory and Computer Science Prize from the Game Theory Society for "the best paper at the interface of game theory and computer science",^[9] in particular "for its key conceptual and technical contributions";^[10] and the outstanding paper prize from the Society for Industrial and Applied Mathematics (SIAM).

He was appointed a tenured Professor at MIT in May 2015.^[11]

He is a co-founder and chief scientist of Archimedes AI research center.^{[citation needed]}

Awards and honors

Constantinos Daskalakis was awarded the 2008 ACM Doctoral Dissertation Award for advancing our understanding of behavior in complex networks of interacting individuals, such as those enabled and created by the Internet. His dissertation on the computational complexity of Nash Equilibria provides a novel, algorithmic perspective on game theory and the concept of the Nash equilibrium.^[12] For this work Daskalakis was also awarded the 2008 Kalai Prize for outstanding articles at the interface of computer science and game theory, along with Christos Papadimitriou and Paul W. Goldberg.^[8]

In 2018, Daskalakis was awarded the Nevanlinna Prize for "transforming our understanding of the computational complexity of fundamental problems in markets, auctions, equilibria and other economic structures".^[13] He also received the Simons Foundation Investigator award in Theoretical Computer Science, an award designed for "outstanding scientists in their most productive years," who are "providing leadership to the field".^[14]

He was named to the 2022 class of ACM Fellows, "for fundamental contributions to algorithmic game theory, mechanism design, sublinear algorithms, and theoretical machine learning".^[15]

References

This page was last edited on 24 March 2024, at 23:28