Christos Papadimitriou
Affiliations: | Electrical Engineering and Computer Science | University of California, Berkeley, Berkeley, CA, United States |
Area:
Biosystems & Computational Biology (BIO); Database Management Systems (DBMS); Theory (THY)Google:
"Christos Papadimitriou"Bio:
Children
Sign in to add trainee| Prashant C. Raju | research assistant | 2019-2020 | Columbia (Neurotree) |
| Yaron Singer | grad student | UC Berkeley | |
| Joseph S. B. Mitchell | grad student | 1986 | Stanford (MathTree) |
| Deborah G. Goldman | grad student | 2000 | UC Berkeley |
| Edouard L. Servan-Schreiber | grad student | 2000 | UC Berkeley |
| Christopher M. Umans | grad student | 2000 | UC Berkeley |
| Ziv Bar-Yossef | grad student | 2002 | UC Berkeley |
| Kunal Talwar | grad student | 2004 | UC Berkeley |
| Felix T. Wu | grad student | 2005 | UC Berkeley |
| Konstantinos Daskalakis | grad student | 2008 | UC Berkeley |
| Alexander Fabrikant | grad student | 2008 | UC Berkeley |
| Henry C. Lin | grad student | 2009 | UC Berkeley |
| Gregory J. Valiant | grad student | 2012 | UC Berkeley |
| Georgios Pierrakos | grad student | 2013 | UC Berkeley |
| Christopher A. Wilkens | grad student | 2013 | UC Berkeley |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Milionis J, Papadimitriou C, Piliouras G, et al. (2023) An impossibility theorem in game dynamics. Proceedings of the National Academy of Sciences of the United States of America. 120: e2305349120 |
| Papadimitriou C, Piliouras G. (2018) From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory. Entropy (Basel, Switzerland). 20 |
| Cai Y, Candogan O, Daskalakis C, et al. (2016) Zero-Sum polymatrix games: A generalization of minmax Mathematics of Operations Research. 41: 648-655 |
| Livnat A, Papadimitriou C. (2016) Sex as an algorithm: the theory of evolution under the lens of computation Communications of the Acm. 59: 84-93 |
| Papadimitriou C, Pierrakos G, Psomas CA, et al. (2016) On the complexity of dynamic mechanism design Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 3: 1458-1475 |
| Daskalakis C, Papadimitriou CH. (2015) Approximate nash equilibria in anonymous games Journal of Economic Theory. 156: 207-245 |
| Papadimitriou C, Pierrakos G. (2015) Optimal deterministic auctions with correlated priors Games and Economic Behavior. 92: 430-454 |
| Papadimitriou C. (2015) The Complexity of Computing Equilibria Handbook of Game Theory With Economic Applications. 4: 779-810 |
| Papadimitriou C. (2014) Algorithms, complexity, and the sciences. Proceedings of the National Academy of Sciences of the United States of America. 111: 15881-7 |
| Diakonikolas I, Papadimitriou C, Pierrakos G, et al. (2012) Efficiency-revenue trade-offs in auctions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7392: 488-499 |