Constantinos Daskalakis

Constantinos Daskalakis (2014).

Constantinos Daskalakis (born April 29, 1981 in Athens ) is a Greek theoretical computer scientist .

Daskalakis studied at the National Technical University in Athens with a diploma in electrical engineering and computer science in 2004 and at the University of California, Berkeley , where he received his doctorate in 2008 under Christos Papadimitriou (The complexity of Nash equilibria). As a post-doctoral student , he was with Jennifer Chayes at Microsoft Research . The dissertation received the ACM Dissertation Award. Since 2015 he has been a professor at the Massachusetts Institute of Technology (MIT) and at the CSAIL there .

Daskalakis deals with complexity theory at the intersection with game theory, economics, stochastics and machine learning. He solved long-standing problems about the complexity of Nash equilibria in game theory , the complexity of auctions and the behavior of machine learning methods such as the expectation-maximization algorithm. He also found efficient methods for testing statistical hypotheses, machine learning in high dimensions, and obtained results on the structure and concentration properties of high dimensional distributions.

In 2010 he was a Sloan Research Fellow and in 2012 he received the Microsoft Research Faculty Fellowship. In 2008 he received along with Paul W. Goldberg and Christos Papadimitriou the Kalai price of the Game Theory Society . In 2018 he received the Nevanlinna Prize , the Google Faculty Research Award and the Simons Foundation Investigator Award. Also for 2018 he was awarded the Grace Murray Hopper Award .

Fonts (selection)

• with C. Papadimitriou: Three-player games are hard, Electronic colloquium on computational complexity, Volume 139, 2005, pp. 81–87
• with E. Mossel, S. Roch: Optimal phylogenetic reconstruction, Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 2006 (and Probability Theory and Related Fields, Volume 149, 2011, pp. 149-189)
• with Paul Goldberg, Christos Papadimitriou: The Complexity of Computing a Nash Equilibrium, 38th ACM Symposium on Theory of Computing (STOC), 2006, and SIAM Journal on Computing, Volume 39, 2009, pp. 195-259
• with Goldberg, Papadimitriou: The complexity of computing a Nash equilibrium, Communications of the ACM, Vol. 52, No. 2, 2009, pp. 89-97
• with A. Mehta, C. Papadimitriou: Progress in approximate Nash equilibria, Proceedings of the 8th ACM Conference on Electronic Commerce, 2007, pp. 355-358
• with A. Mehta, C. Papadimitriou: A note on approximate Nash equilibria, Theoretical Computer Science, Volume 410, 2009, pp. 1581-1588
• with Y. Cai, SM Weinberg: Optimal multi-dimensional mechanism design: Reducing revenue to welfare maximization, 53rd Annual Symposium on Foundations of Computer Science (FOCS), 2012

Web links

• Homepage
• Erica Klarreich, A Poet of Computation Who Uncovers Distant Truths , Quanta Magazine August 1, 2018
• Videos by and about Constantinos Daskalakis in the AV portal of the Technical Information Library

Individual evidence

1. ↑ Constantinos Daskalakis in the Mathematics Genealogy Project (English)