Constantinos Daskalakis

    Avanessians Professor of Computer Science, EECS and CSAIL, MIT

Bio at a Glance

CSAIL, EECS, MIT
Avanessians Professor, 2022 - present
Professor, 2018 - 2022
Associate Professor (with tenure), 2015 - 2018
X-Window Consortium Associate Professor, 2012 - 2015
X-Window Consortium Assistant Professor, 2011 - 2012
Assistant Professor, 2009 - 2011

MICROSOFT RESEARCH, NEW ENGLAND
Post-Doctoral Researcher, 2008-2009

UNIVERSITY OF CALIFORNIA, BERKELEY
Ph.D. in Computer Science, 2004-2008
Thesis: The Complexity of Nash Equilibria
Advisor: Christos H. Papadimitriou

NATIONAL TECHNICAL UNIVERSITY of ATHENS (NTUA), GREECE
Diploma in Electrical and Computer Engineering, 1999-2004
Thesis: On the Existence of Pure Nash Equilibria in Graphical Games with succinct description
Advisor: Stathis Zachos

Publications

Chronological list, journal papers, expository articles

or clustered by topic: Economics, Game theory, and their interface with Computation, Machine Learning, Statistics, and Probability, and Computational Biology.

Journal Publications

  • Itai Ashlagi, Constantinos Daskalakis, Nima Haghpanah: Sequential Mechanisms with Ex Post Individual Rationality.
    Operations Research (OR), 71(1): 245-258, 2023. pdf
  • Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy: Multi-Item Nontruthful Auctions Achieve Good Revenue.
    SIAM Journal of Computing, 51(6):1796-1838, 2022. arXiv
  • Constantinos Daskalakis, Vasilis Syrgkanis: Learning in auctions: Regret is hard, envy is easy.
    Games and Economic Behavior (GEB), 134:308-343, 2022. arXiv
  • Liu Yang, Constantinos Daskalakis, George E. Karniadakis: Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models.
    SIAM Journal of Scientific Computing, 44(1): 80-, 2022. arXiv
  • Constantinos Daskalakis: Equilibria, Fixed Points, and Computational Complexity.
    Proceedings of the International Congress of Mathematicians (ICM 2018), 1:147--209, 2019. pdf
  • Constantinos Daskalakis, Nishanth Dikkala and Gautam Kamath: Testing Ising Models.
    IEEE Transactions on Information Theory, 65(11): 6829-6852, 2019. ieee
  • Constantinos Daskalakis, Nikhil R. Devanur and S. Matthew Weinberg: Revenue Maximization and Ex-Post Budget Constraints.
    ACM Transactions on Economics and Computation, 6(3-4):20:1-20:19, 2018. Special Issue on EC'15. pdf
  • Constantinos Daskalakis, Alan Deckelbaum and Christos Tzamos: Strong Duality for a Multiple-Good Monopolist.
    Econometrica, 85(3):735-767, 2017. arXiv
  • Constantinos Daskalakis, Ilias Diakonikolas and Mihalis Yannakakis: How good is the Chord algorithm?
    SIAM Journal on Computing (SICOMP), 45(3): 811-858, 2016. pdf
  • Yang Cai, Ozan Candogan, Constantinos Daskalakis and Christos Papadimitriou: Zero-sum Polymatrix Games: A Generalization of Minmax.
    Mathematics of Operations Research (MathOR), 41(2): 648-655, 2016. pdf
  • Constantinos Daskalakis and Christos Papadimitriou: Sparse Covers for Sums of Indicators.
    Probability Theory and Related Fields (PTRF), 162(3):679-705, 2015. arXiv
  • Constantinos Daskalakis, Ilias Diakonikolas and Rocco A. Servedio: Learning Poisson Binomial Distributions.
    Algorithmica, 72(1):316-357, 2015. Special Issue on New Theoretical Challenges in Machine Learning. Invited. arXiv
  • Constantinos Daskalakis and Christos Papadimitriou: Approximate Nash Equilibria in Anonymous Games.
    Journal of Economic Theory (JET), 156:207--245, 2015. pdf
  • Yang Cai and Constantinos Daskalakis: Extreme-Value Theorems for Optimal Multidimensional Pricing.
    Games and Economic Behavior, 92:266--305, 2015. Special Issue for STOC/FOCS/SODA 2011. Invited. arxiv
  • Constantinos Daskalakis, Alan Deckelbaum and Anthony Kim: Near-Optimal No-Regret Algorithms for Zero-sum Games.
    Games and Economic Behavior, 92:327-348, 2015. Special Issue for STOC/FOCS/SODA 2011. Invited. pdf
  • Constantinos Daskalakis, Ilias Diakonikolas and Rocco A. Servedio: Learning k-Modal Distributions via Testing.
    Theory of Computing, 10:535--570, 2014. arXiv
  • Constantinos Daskalakis: On the Complexity of Approximating a Nash Equilibrium.
    ACM Transactions on Algorithms (TALG), 9(3): 23, 2013. Special Issue for SODA 2011. Invited. pdf
  • Constantinos Daskalakis and Sebastien Roch: Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis.
    Annals of Applied Probability, 23(2): 693--721, 2013. arxiv
  • Sanjeev Arora, Constantinos Daskalakis and David Steurer: Message-Passing Algorithms and Improved LP Decoding.
    IEEE Transactions on Information Theory, 58(12): 7260--7271, 2012. pdf
  • Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld and Elad Verbin: Sorting and Selection in Posets.
    SIAM Journal on Computing (SICOMP), 40(3): 597-622, 2011. arxiv
  • Constantinos Daskalakis, Elchanan Mossel and Sebastien Roch: Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep.
    SIAM Journal on Discrete Mathematics, 25(2): 872-893, 2011. arxiv
  • Constantinos Daskalakis, Alexandros G. Dimakis and Elchanan Mossel: Connectivity and Equilibrium in Random Games.
    Annals of Applied Probability, 21(3):987-1016, 2011. arxiv
  • Constantinos Daskalakis, Elchanan Mossel and Sebastien Roch: Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel's Conjecture.
    Probability Theory and Related Fields (PTRF), 149(1-2):149-189, 2011. arxiv
  • Constantinos Daskalakis, Aranyak Mehta and Christos H. Papadimitriou: A Note on Approximate Nash Equilibria.
    Theoretical Computer Science, 410(17), 1581--1588, 2009. Special Issue for WINE 2006. Invited. pdf
  • Constantinos Daskalakis, Paul W. Goldberg and Christos H. Papadimitriou: The Complexity of Computing a Nash Equilibrium.
    SIAM Journal on Computing (SICOMP), 39(1), 195--259, May 2009. Special issue for STOC 2006. Invited. pdf
    2008 Kalai Prize from Game Theory Society; 2011 SIAM Outstanding Paper Prize; 2022 ACM SIGECOM Test of Time Award.
  • Constantinos Daskalakis, Alexandros G. Dimakis, Richard Karp and Martin Wainwright: Probabilistic Analysis of Linear Programming Decoding.
    IEEE Transactions on Information Theory, 54(8), 3565-3578, August 2008. arXiv

Expository Articles

  • Constantinos Daskalakis: Technical Perspective: The Quest for Optimal Multi-Item Auctions.
    Communications of the ACM 64(8): 108, 2021. html
  • Constantinos Daskalakis: Nash equilibria: Complexity, symmetries, and approximation.
    Computer Science Review 3(2): 87--100, 2009. pdf
  • Constantinos Daskalakis, Paul W. Goldberg and Christos H. Papadimitriou: The complexity of computing a Nash equilibrium.
    Communications of the ACM 52(2):89--97, 2009. pdf
    2008 Kalai Prize from Game Theory Society; 2011 SIAM Outstanding Paper Prize; 2022 ACM SIGECOM Test of Time Award.

Publications in Chronological Order

  • Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich: From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces.
    In the 56th ACM Symposium on Theory of Computing, STOC 2024. arXiv. twitter summary
  • Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, Abhishek Shetty: Smooth Nash Equilibria: Algorithms and Complexity.
    In the 15th Innovations in Theoretical Computer Science (ITCS), ITCS 2024. arXiv.
  • Giannis Daras, Yuval Dagan, Alexandros G. Dimakis, Constantinos Daskalakis: Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent.
    In the 37th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2023. arXiv.
  • Angelos Assos, Idan Attias, Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson: Online Learning and Solving Infinite Games with an ERM Oracle.
    In the 35th Annual Conference on Learning Theory, COLT 2023. arXiv.
  • Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis, Manolis Zampetakis: STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games.
    In the 35th Annual Conference on Learning Theory, COLT 2023. arXiv.
  • Constantinos Daskalakis, Noah Golowich, Kaiqing Zhang: The Complexity of Markov Equilibrium in Stochastic Games.
    In the 35th Annual Conference on Learning Theory, COLT 2023. arXiv.
  • Davin Choo, Yuval Dagan, Constantinos Daskalakis, Anthimos-Vardis Kandiros: Learning and Testing Latent-Tree Ising Models Efficiently.
    In the 35th Annual Conference on Learning Theory, COLT 2023. arXiv.
  • Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis: What Makes A Good Fisherman? Linear Regression under Self-Selection Bias.
    In the 55th ACM Symposium on Theory of Computing, STOC 2023. arXiv.
  • Giannis Daras, Yuval Dagan, Alex Dimakis, Constantinos Daskalakis: Score-Guided Intermediate Level Optimization: Fast Langevin Mixing for Inverse Problems.
    In the 39th International Conference on Machine Learning, ICML 2022. arXiv.
  • Yuval Dagan, Vardis Kandiros, Constantinos Daskalakis: EM's Convergence in Gaussian Latent Tree Models.
    In the 35th Annual Conference on Learning Theory, COLT 2022. arXiv.
  • Yang Cai, Constantinos Daskalakis: Recommender Systems meet Mechanism Design.
    In the 23rd ACM Conference on Economics and Computation, EC 2022. arXiv.
  • Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis: Estimation of Standard Auction Models.
    In the 23rd ACM Conference on Economics and Computation, EC 2022. arXiv.
  • Constantinos Daskalakis, Noah Golowich: Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games.
    In the 54th ACM Symposium on Theory of Computing, STOC 2022. arXiv.
  • Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm: Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games.
    In the 54th ACM Symposium on Theory of Computing, STOC 2022. arXiv.
  • Constantinos Daskalakis, Petros Dellaportas, Ares Panos: How Good are Low-Rank Approximations in Gaussian Process Regression?
    In the 36th AAAI Conference on Artificial Intelligence (AAAI), AAAI 2022. arxiv.
  • Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich: Near-Optimal No-Regret Learning in General Games.
    In the 35th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2021. Oral. arXiv. twitter summary
  • Constantinos Daskalakis, Patroklos Stefanou, Rui Yao, Manolis Zampetakis: Efficient Truncated Linear Regression with Unknown Noise Variance.
    In the 35th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2021. arXiv.
  • Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Surbhi Goel, Anthimos Vardis Kandiros: Statistical Estimation from Dependent Data.
    In the 38th International Conference on Machine Learning, ICML 2021. arXiv.
  • Constantinos Daskalakis, Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis: A Statistical Taylor Theorem and Extrapolation of Truncated Densities.
    In the 34th Annual Conference on Learning Theory, COLT 2021. arXiv.
  • Constantinos Daskalakis, Qinxuan Pan: Sample-Optimal and Efficient Learning of Tree Ising models.
    In the 53rd ACM Symposium on Theory of Computing, STOC 2021. arXiv. twitter summary
  • Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis: The Complexity of Constrained Min-Max Optimization.
    In the 53rd ACM Symposium on Theory of Computing, STOC 2021. arXiv. twitter summary
  • Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Anthimos Vardis Kandiros: Learning Ising Models from One or Multiple Samples.
    In the 53rd ACM Symposium on Theory of Computing, STOC 2021. arXiv. twitter summary
  • Jelena Diakonikolas, Constantinos Daskalakis, Michael I. Jordan: Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization.
    In the 24th International Conference on Artificial Intelligence and Statistics (AISTATS), AISTATS 2021. arXiv
  • Mucong Ding, Constantinos Daskalakis, Soheil Feizi: GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences.
    In the 24th International Conference on Artificial Intelligence and Statistics (AISTATS), AISTATS 2021. Oral. arXiv
  • Fotini Christia, Michael Curry, Constantinos Daskalakis, Erik Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff: Scalable Equilibrium Computation in Multi-agent Influence Games on Networks.
    In the 34th AAAI Conference on Artificial Intelligence, AAAI 2021. arXiv
  • Noah Golowich, Sarath Pattathil, Constantinos Daskalakis: Tight last-iterate convergence rates for no-regret learning in multi-player games.
    In the 34th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2020. arXiv
  • Constantinos Daskalakis, Dylan Foster, Noah Golowich: Independent Policy Gradient Methods for Competitive Reinforcement Learning.
    In the 34th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2020. arXiv
  • Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis: Truncated Linear Regression in High Dimensions.
    In the 34th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2020. arXiv
  • Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis: Constant-Expansion Suffices for Compressed Sensing with Generative Priors.
    In the 34th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2020. Spotlight. arXiv
  • Constantinos Daskalakis, Manolis Zampetakis: More Revenue from Two Samples via Factor Revealing SDPs.
    In the 21st ACM Conference on Economics and Computation, EC 2020. pdf
  • Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy: Simple, Credible, and Approximately-Optimal Auctions.
    In the 21st ACM Conference on Economics and Computation, EC 2020. arXiv
  • Johannes Brustle, Yang Cai, Constantinos Daskalakis: Multi-Item Mechanisms without Item-Independence: Learnability via Robustness.
    In the 21st ACM Conference on Economics and Computation, EC 2020. arXiv
  • Qi Lei, Jason D. Lee, Alexandros G. Dimakis, Constantinos P. Daskalakis: SGD Learns One-Layer Networks in WGANs.
    In the 37th International Conference on Machine Learning, ICML 2020. arXiv
  • Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, Asuman Ozdaglar: Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems.
    In the 33nd Annual Conference on Learning Theory, COLT 2020. arXiv
  • Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas: Logistic regression with peer-group effects via inference in higher-order Ising models.
    In the 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020. arXiv.
  • Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis: A Theoretical and Practical Framework for Regression and Classification from Truncated Samples.
    In the 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020. pdf.
  • Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis: Computationally and Statistically Efficient Truncated Regression.
    In the 32nd Annual Conference on Learning Theory, COLT 2019. arXiv.
  • Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti: Generalization and learning under Dobrushin's condition.
    In the 32nd Annual Conference on Learning Theory, COLT 2019. arXiv.
  • Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas: Regression from Dependent Observations.
    In the 51st Annual ACM Symposium on the Theory of Computing, STOC 2019. arXiv
  • Andrew Ilyas, Ajil Jalal, Eirini Asteri, Constantinos Daskalakis, Alexandros G. Dimakis: The Robust Manifold Defense: Adversarial Training using Generative Models.
    arXiv, 2019.
  • Constantinos Daskalakis, Ioannis Panageas: Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization.
    In the 10th Innovations in Theoretical Computer Science (ITCS) conference, ITCS 2019. arXiv.
  • Constantinos Daskalakis, Ioannis Panageas: The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization.
    In the 32nd Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2018. arXiv.
  • Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti: HOGWILD!-Gibbs can be PanAccurate.
    In the 32nd Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2018. arXiv.
  • Nima Anari, Constantinos Daskalakis, Wolfgang Maass, Christos Papadimitriou, Amin Saberi, Santosh Vempala: Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons.
    In the 32nd Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2018. arXiv.
  • Jayadev Acharya, Arnab Bhattacharyya, Constantinos Daskalakis, Saravanan Kandasamy: Learning and Testing Causal Models with Interventions.
    In the 32nd Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2018. arXiv.
  • Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis: Efficient Statistics, in High Dimensions, from Truncated Samples.
    In the 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. arXiv.
  • Shipra Agrawal, Constantinos Daskalakis, Vahab Mirrokni, Balasubramanian Sivan: Robust Repeated Auctions under Heterogeneous Buyer Behavior.
    In the 19th ACM conference on Economics and Computation, EC 2018. arxiv.
  • Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin: Testing Symmetric Markov Chains from a Single Trajectory.
    In the 31st Annual Conference on Learning Theory, COLT 2018. arxiv.
  • Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, Haoyang Zeng: Training GANs with Optimism.
    In the 6th International Conference on Learning Representations, ICLR 2018. arXiv.
  • Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis: Bootstrapping EM via EM and Convergence Analysis in the Naive Bayes Model.
    In the 21st International Conference on Artificial Intelligence and Statistics, AISTATS 2018. pdf
  • Constantinos Daskalakis, Christos Tzamos and Manolis Zampetakis: A Converse to Banach's Fixed Point Theorem and its CLS Completeness.
    In the 50th Annual ACM Symposium on the Theory of Computing, STOC 2018. arXiv
  • Constantinos Daskalakis, Gautam Kamath and John Wright: Which Distribution Distances are Sublinearly Testable?.
    In the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. arXiv
  • Constantinos Daskalakis, Nishanth Dikkala and Gautam Kamath: Testing Ising Models.
    In the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. arXiv
  • Constantinos Daskalakis, Nishanth Dikkala and Gautam Kamath: Concentration of Multilinear Functions of the Ising Model with Applications to Network Data.
    In the 31st Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2017. arXiv
  • Yang Cai and Constantinos Daskalakis: Learning Multi-Item Auctions with (or without) Samples.
    In the 58th IEEE Symposium on Foundations of Computer Science (FOCS), FOCS 2017. arxiv
  • Constantinos Daskalakis and Yasushi Kawase: Optimal Stopping Rules for Sequential Hypothesis Testing.
    In the 25th Annual European Symposium on Algorithms (ESA), ESA 2017. pdf
  • Bryan Cai, Constantinos Daskalakis and Gautam Kamath: Priv'IT: Private and Sample Efficient Identity Testing.
    In the 34th International Conference on Machine Learning, ICML 2017. arXiv
  • Constantinos Daskalakis, Christos Tzamos and Manolis Zampetakis: Ten Steps of EM Suffice for Mixtures of Two Gaussians.
    In the 30th Annual Conference on Learning Theory, COLT 2017. Preliminary version presented at NeurIPS 2016 Workshop on Non-Convex Optimization for Machine Learning. arXiv
  • Constantinos Daskalakis and Qinxuan Pan: Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing.
    In the 30th Annual Conference on Learning Theory, COLT 2017. arXiv
  • Constantinos Daskalakis, Alan Deckelbaum and Christos Tzamos: Strong Duality for a Multiple-Good Monopolist.
    Econometrica, 85(3):735-767, 2017. arXiv
  • Yang Cai, Ozan Candogan, Constantinos Daskalakis and Christos Papadimitriou: Zero-sum Polymatrix Games: A Generalization of Minmax.
    Mathematics of Operations Research, 41(2): 648-655, 2016. pdf
  • Constantinos Daskalakis and Vasilis Syrgkanis: Learning in Auctions: Regret is Hard, Envy is Easy.
    In the 57th IEEE Symposium on Foundations of Computer Science (FOCS), FOCS 2016. arxiv
  • Aviv Adler, Constantinos Daskalakis and Erik Demaine: The Complexity of Hex and the Jordan Curve Theorem.
    In the 43rd International Colloquium on Automata, Languages and Programming, ICALP 2016. pdf
  • Itai Ashlagi, Constantinos Daskalakis and Nima Haghpanah: Sequential Mechanisms with Ex-post Participation Guarantees..
    In the 17th ACM Conference on Economics and Computation (EC), EC 2016. Invited to Special Issue. arxiv
  • Constantinos Daskalakis, Christos Papadimitriou and Christos Tzamos: Does Information Revelation Improve Revenue?.
    In the 17th ACM Conference on Economics and Computation (EC), EC 2016. Invited to Special Issue. pdf
  • Constantinos Daskalakis, Anindya De, Gautam Kamath and Christos Tzamos: A Size-Free CLT for Poisson Multinomials and its Applications.
    In the 48th ACM Symposium on Theory of Computing, STOC 2016. arXiv
  • Constantinos Daskalakis and Sebastien Roch: Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound.
    In the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2016. arXiv
  • Constantinos Daskalakis and Christos Papadimitriou: Sparse Covers for Sums of Indicators.
    Probability Theory and Related Fields, 162(3):679-705, 2015. arXiv
  • Constantinos Daskalakis and Christos Papadimitriou: Approximate Nash Equilibria in Anonymous Games.
    Journal of Economic Theory, 156:207--245, 2015. pdf
  • Jayadev Acharya, Constantinos Daskalakis and Gautam Kamath: Optimal Testing for Properties of Distributions.
    In the 29th Annual Conference on Neural Information Processing Systems (NeurIPS), NeurIPS 2015. Spotlight. arXiv
  • Constantinos Daskalakis, Gautam Kamath and Christos Tzamos: On the Structure, Covering, and Learning of Poisson Multinomial Distributions.
    In the 56th IEEE Symposium on Foundations of Computer Science (FOCS), FOCS 2015. arXiv
  • Yang Cai, Constantinos Daskalakis and Christos H. Papadimitriou: Optimum Statistical Estimation with Strategic Data Sources.
    In the 28th Annual Conference on Learning Theory (COLT), COLT 2015. arXiv
  • Constantinos Daskalakis, Alan Deckelbaum and Christos Tzamos: Strong Duality for a Multiple-Good Monopolist.
    In the 16th ACM Conference on Economics and Computation (EC), EC 2015. arXiv
  • Constantinos Daskalakis, Nikhil Devanur and Matt Weinberg: Revenue Maximization and Ex-Post Budget Constraints.
    In the 16th ACM Conference on Economics and Computation (EC), EC 2015. arXiv
  • Constantinos Daskalakis and Jayadev Acharya: Testing Poisson Binomial Distributions.
    In the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2015. arXiv
  • Constantinos Daskalakis and Matt Weinberg: Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms.
    In the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2015. arXiv
  • Constantinos Daskalakis and Qinxuan Pan: A Counter-Example to Karlin's Strong Conjecture for Fictitious Play.
    In the 55th IEEE Symposium on Foundations of Computer Science, FOCS 2014. arxiv
  • Constantinos Daskalakis and Gautam Kamath: Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians.
    In the 27th Annual Conference on Learning Theory (COLT), COLT 2014. arxiv
  • Constantinos Daskalakis, Alan Deckelbaum and Christos Tzamos: The Complexity of Optimal Mechanism Design.
    In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2014. arxiv
  • Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, and Rocco Servedio: A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage.
    In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2014. arxiv
  • Constantinos Daskalakis, Ilias Diakonikolas, Ryan O'Donnel, Rocco Servedio and Li-Yang Tan: Learning Sums of Independent Integer Random Variables.
    In the 54th IEEE Symposium on Foundations of Computer Science, FOCS 2013. pdf
  • Yang Cai, Constantinos Daskalakis and Matt Weinberg: Understanding Incentives: Mechanism Design becomes Algorithm Design.
    In the 54th IEEE Symposium on Foundations of Computer Science, FOCS 2013. arxiv
  • Constantinos Daskalakis, Alan Deckelbaum and Christos Tzamos: Mechanism Design via Optimal Transport.
    In the 14th ACM Conference on Electronic Commerce, EC 2013. Best Paper and Best Student Paper Award. pdf
  • Yang Cai, Constantinos Daskalakis and Matt Weinberg: Reducing Revenue to Welfare Maximization : Approximation Algorithms and other Generalizations.
    In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2013. pdf
  • Pablo Azar, Constantinos Daskalakis, Silvio Micali and Matt Weinberg: Optimal and Efficient Parametric Auctions.
    In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2013. pdf
  • Constantinos Daskalakis, Ilias Diakonikolas, Rocco Servedio, Greg Valiant and Paul Valiant: Testing k-Modal Distributions: Optimal Algorithms via Reductions.
    In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA 2013. arxiv
  • Constantinos Daskalakis, Alan Deckelbaum and Christos Tzamos: Optimal Pricing is Hard.
    In the 8th Workshop on Internet & Network Economics, WINE 2012. pdf
  • Yang Cai, Constantinos Daskalakis and Matt Weinberg: Optimal Multi-Dimensional Mechanism Design: Reducing Revenue to Welfare Maximization.
    In the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), FOCS 2012. FOCS 2022 Test of Time Award. arxiv
  • Constantinos Daskalakis and Matt Weinberg: Symmetries and Optimal Multi-Dimensional Mechanism Design.
    In the 13th ACM Conference on Electronic Commerce, EC 2012. ECCC Report. Best Student Paper Award.
  • Yang Cai, Constantinos Daskalakis and Matt Weinberg: An Algorithmic Characterization of Multi-Dimensional Mechanisms.
    In the 44th ACM Symposium on Theory of Computing, STOC 2012. ECCC Report.
  • Constantinos Daskalakis, Ilias Diakonikolas and Rocco A. Servedio: Learning Poisson Binomial Distributions.
    In the 44th ACM Symposium on Theory of Computing, STOC 2012. arXiv
    Algorithmica, 72(1):316-357, 2015. Special Issue on New Theoretical Challenges in Machine Learning. Invited. arXiv
  • Constantinos Daskalakis, Ilias Diakonikolas and Rocco A. Servedio: Learning k-Modal Distributions via Testing.
    In the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. arXiv
    Theory of Computing, 10:535--570, 2014. arXiv
  • Constantinos Daskalakis and George Pierrakos: Simple, Optimal and Efficient Auctions.
    In the 7th Workshop on Internet & Network Economics, WINE 2011. pdf
  • Yang Cai and Constantinos Daskalakis: Extreme-Value Theorems for Optimal Multidimensional Pricing.
    In the 52nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2011. arxiv
    Games and Economic Behavior, 92:266--305, 2015. Special Issue for STOC/FOCS/SODA 2011. Invited. arxiv
  • Constantinos Daskalakis, Alexandros G. Dimakis and Elchanan Mossel: Connectivity and Equilibrium in Random Games.
    Annals of Applied Probability, 21(3):987-1016, 2011. arxiv
  • Constantinos Daskalakis, Elchanan Mossel and Sebastien Roch: Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel's Conjecture.
    Probability Theory and Related Fields, 149(1-2):149-189, 2011. arxiv
  • Constantinos Daskalakis: On the Complexity of Approximating a Nash Equilibrium.
    In the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011.
    ACM Transactions on Algorithms (TALG), 9(3): 23, 2013. Special Issue for SODA 2011. Invited. pdf
  • Constantinos Daskalakis, Alan Deckelbaum and Anthony Kim: Near-Optimal No-Regret Algorithms for Zero-sum Games.
    In the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. pdf
    Games and Economic Behavior, 92:327-348, 2015. Special Issue for STOC/FOCS/SODA 2011. Invited. pdf
  • Yang Cai and Constantinos Daskalakis: On Minmax Theorems for Multiplayer Games.
    In the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. pdf
  • Constantinos Daskalakis and Christos Papadimitriou: Continuous Local Search.
    In the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. pdf and corrigendum
  • C. Daskalakis, R. Frongillo, C. H. Papadimitriou, G. Pierrakos and G. Valiant: On Learning Algorithms for Nash Equilibria.
    In the 3rd International Symposium on Algorithmic Game Theory, SAGT 2010. pdf
  • Constantinos Daskalakis and Sebastien Roch: Alignment-Free Phylogenetic Reconstruction.
    In the 14th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2010. pdf
    Annals of Applied Probability, 23(2): 693--721, 2013. arxiv
  • Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim and Sebastien Roch: Global Alignment of Molecular Sequences via Ancestral State Reconstruction.
    In the 1st Symposium on Innovations in Computer Science, ICS 2010. conference version
    Stochastic Processes and their Applications, 122(12): 3852--3874, 2012. journal version
  • Constantinos Daskalakis, Ilias Diakonikolas and Mihalis Yannakakis: How good is the Chord algorithm?
    In the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010. pdf
    SIAM Journal on Computing, 45(3): 811-858, 2016. pdf
  • Ilan Adler, Constantinos Daskalakis and Christos H. Papadimitriou: A Note on Strictly Competitive Games.
    In the 5th Workshop on Internet & Network Economics, WINE 2009. pdf
  • Constantinos Daskalakis and Christos H. Papadimitriou: On a Network Generalization of the Minmax Theorem.
    In the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009. pdf
  • Constantinos Daskalakis and Christos H. Papadimitriou: On Oblivious PTAS's for Nash Equilibrium.
    In the 41st ACM Symposium On Theory of Computing, STOC 2009. arXiv
  • Sanjeev Arora, Constantinos Daskalakis and David Steurer: Message-Passing Algorithms and Improved LP Decoding.
    In the 41st ACM Symposium On Theory of Computing, STOC 2009.
    IEEE Transactions on Information Theory, 58(12):7260--7271, 2012. pdf
  • Constantinos Daskalakis, Elchanan Mossel and Sebastien Roch: Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep.
    In the 13th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2009. arxiv
    Also in SIAM Journal on Discrete Mathematics, 25(2): 872-893, 2011.
  • Kamalika Chaudhuri, Constantinos Daskalakis, Robert Kleinberg and Henry Lin: Online Bipartite Perfect Matching With Augmentation.
    In the 28th Conference on Computer Communications, IEEE INFOCOM 2009. pdf
  • Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant and Paul Valiant: On the Complexity of Nash Equilibria of Action-Graph Games.
    In the 20th Annual ACM-SIAM Symposium On Discrete Algorithms, SODA 2009. arxiv
  • Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld and Elad Verbin: Sorting and Ranking in Partially Ordered Sets.
    In the 20th Annual ACM-SIAM Symposium On Discrete Algorithms, SODA 2009. arxiv
    SIAM Journal on Computing, 40(3): 597-622, 2011.
  • Constantinos Daskalakis: An Efficient PTAS for Two-Strategy Anonymous Games.
    In the 4th Workshop on Internet and Network Economics, WINE 2008. arxiv
  • Constantinos Daskalakis and Christos H. Papadimitriou: Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games.
    In the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. arxiv
  • Constantinos Daskalakis and Christos H. Papadimitriou: Computing Equilibria in Anonymous Games.
    In the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. arXiv.
  • Constantinos Daskalakis, Aranyak Mehta and Christos H. Papadimitriou: Progress in Approximate Nash Equilibria.
    In the 8th ACM Conference on Electronic Commerce, EC 2007. pdf.
  • Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis and Sebastien Roch: An Analysis of Preferential Attachment with Fitness.
    In the 39th ACM Symposium on Theory of Computing, STOC 2007. arxiv
  • Constantinos Daskalakis, Alexandros G. Dimakis, Richard Karp and Martin Wainwright: Probabilistic Analysis of Linear Programming Decoding.
    In the 18th Annual ACM-SIAM Symposium On Discrete Algorithms, SODA 2007. arXiv
    Journal version in IEEE Transactions on Information Theory, 54(8), 3565-3578, August 2008. arxiv
  • C. Daskalakis, C. Hill, A. Jaffe, R. Mihaescu, E. Mossel and S. Rao: Maximal Accurate Forests From Distance Matrices.
    In the 10th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2006. pdf.
  • Constantinos Daskalakis, Alex Fabrikant and Christos Papadimitriou: The Game World is Flat: The Complexity of Nash Equilibria in Succinct Games.
    In the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006. pdf
  • Constantinos Daskalakis and Christos Papadimitriou: Computing Pure Nash Equilibria via Markov Random Fields.
    In the 7th ACM Conference on Electronic Commerce, EC 2006. Best Paper Award. pdf
  • Constantinos Daskalakis and Christos H. Papadimitriou: Three-Player Games Are Hard.
    ECCC Report 2005.
  • Constantinos Daskalakis, Paul W. Goldberg and Christos H. Papadimitriou: The Complexity of Computing a Nash Equilibrium.
    In the 38th ACM Symposium on Theory of Computing, STOC 2006. pdf
    Journal version in SIAM Journal on Computing, 39(1), 195--259, May 2009. (Invited, special issue for STOC 2006.)
    Expository article in Communications of the ACM 52(2):89--97, 2009. (Invited.)
    2008 Kalai Prize from Game Theory Society; 2011 SIAM Outstanding Paper Prize; 2022 ACM SIGECOM Test of Time Award.
  • Constantinos Daskalakis, Elchanan Mossel and Sebastien Roch: Optimal Phylogenetic Reconstruction.
    In the 38th ACM Symposium on Theory of Computing, STOC 2006. arXiv
    Journal version in Probability Theory and Related Fields, 149(1-2):149-189, 2011.
  • Constantinos Daskalakis and Christos Papadimitriou: The Complexity of Games on Highly Regular Graphs.
    In the 13th Annual European Symposium on Algorithms, ESA 2005. pdf

List of Publications by Topic

Interface of Computation with Economics and Game Theory

 

Machine Learning, Statistics and Probability

 

Computational Biology

 

Other Topics


[Accessibility]