World's Best Scientists 2026 revealed!
Constantinos Daskalakis

Constantinos Daskalakis

D-Index & Metrics

Computer Science

D-Index
53
Citations
9913
World Ranking
4877
National Ranking
2268

Constantinos Daskalakis publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Constantinos Daskalakis sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 250 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 560 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 424 scientists 242–251 publications: 408 scientists 252–261 publications: 378 scientists 262–271 publications: 300 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 181 publications — 39th percentile

39% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Constantinos Daskalakis D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Constantinos Daskalakis sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 984 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 969 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 765 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 517 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 53 D-Index — 67th percentile

67% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 2018 - ACM Grace Murray Hopper Award For seminal contributions to the complexity of Nash Equilibria.
  • 2018 - Rolf Nevanlinna Prize "For transforming our understanding of the computational complexity of fundamental problems in markets, auctions, equilibria, and other economic structures. His work provides both efficient algorithms and limits on what can be performed efficiently in these domains."[14]
  • 2010 - Fellow of Alfred P. Sloan Foundation

Overview

Constantinos Daskalakis is a researcher affiliated with MIT in the United States, focused primarily on Computer Science. Their work spans several subfields, including Artificial Intelligence, Management Science and Operations Research, Statistical and Nonlinear Physics, Computer Vision and Pattern Recognition, and Computational Mechanics.

The main research topics covered by Constantinos Daskalakis include:

  • Advanced Bandit Algorithms Research
  • Auction Theory and Applications
  • Sparse and Compressive Sensing Techniques
  • Machine Learning and Algorithms
  • Gaussian Processes and Bayesian Inference
  • Game Theory and Applications
  • Bayesian Modeling and Causal Inference

Publications by this scientist have appeared primarily in the venue arXiv (Cornell University), with 46 contributions. Other publication venues include:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Proceedings of the 23rd ACM Conference on Economics and Computation
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • SIAM Journal on Scientific Computing

Selected recent papers by Constantinos Daskalakis include:

  • "Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models," 2022, SIAM Journal on Scientific Computing
  • "Independent Policy Gradient Methods for Competitive Reinforcement Learning," 2021, arXiv (Cornell University)
  • "Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems," 2020, arXiv (Cornell University)

Frequent collaborators of Constantinos Daskalakis include:

  • Noah Golowich
  • Manolis Zampetakis
  • Yuval Dagan
  • Maxwell Fishelson
  • Yeshwanth Cherapanamjeri

The scientist has received multiple awards recognizing their contributions, including the Rolf Nevanlinna Prize in 2018 for work on computational complexity in markets, auctions, and economic structures. They were also granted the ACM Grace Murray Hopper Award in 2018 for contributions related to the complexity of Nash Equilibria. Earlier in their career, they became a Fellow of the Alfred P. Sloan Foundation in 2010.

Best Publications

  • The Complexity of Computing a Nash Equilibrium

    Constantinos Daskalakis;Paul W. Goldberg;Christos H. Papadimitriou

  • Training GANs with Optimism

    Constantinos Daskalakis;Andrew Ilyas;Vasilis Syrgkanis;Haoyang Zeng

  • A note on approximate Nash equilibria

    Constantinos Daskalakis;Aranyak Mehta;Christos Papadimitriou

  • Three-Player Games Are Hard

    Constantinos Daskalakis;Christos H. Papadimitriou

  • Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization

    Yang Cai;Constantinos Daskalakis;S. Matthew Weinberg

  • The Robust Manifold Defense: Adversarial Training using Generative Models

    Andrew Ilyas;Ajil Jalal;Eirini Asteri;Constantinos Daskalakis

  • An algorithmic characterization of multi-dimensional mechanisms

    Yang Cai;Constantinos Daskalakis;S. Matthew Weinberg

  • Near-optimal no-regret algorithms for zero-sum games

    Constantinos Daskalakis;Alan Deckelbaum;Anthony Kim

  • Progress in approximate nash equilibria

    Constantinos Daskalakis;Aranyak Mehta;Christos Papadimitriou

  • The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization

    Constantinos Daskalakis;Ioannis Panageas

  • Message-Passing Algorithms and Improved LP Decoding

    S. Arora;C. Daskalakis;D. Steurer

  • Optimal testing for properties of distributions

    Jayadev Acharya;Constantinos Daskalakis;Gautam Kamath

  • The complexity of optimal mechanism design

    Constantinos Daskalakis;Alan Deckelbaum;Christos Tzamos

  • First to market is not everything: an analysis of preferential attachment with fitness

    Christian Borgs;Jennifer Chayes;Constantinos Daskalakis;Sebastien Roch

  • Symmetries and optimal multi-dimensional mechanism design

    Constantinos Daskalakis;Seth Matthew Weinberg

  • On oblivious PTAS's for nash equilibrium

    Constantinos Daskalakis;Christos H. Papadimitriou

  • Computing Equilibria in Anonymous Games

    C. Daskalakis;C. Papadimitriou

  • Continuous local search

    Constantinos Daskalakis;Christos Papadimitriou

  • Mechanism design via optimal transport

    Constantinos Daskalakis;Alan Deckelbaum;Christos Tzamos

  • Optimum Statistical Estimation with Strategic Data Sources

    Yang Cai;Constantinos Daskalakis;Christos H. Papadimitriou

  • Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization

    Constantinos Daskalakis;Ioannis Panageas

  • Proceedings of the 2017 ACM Conference on Economics and Computation

    Constantinos Daskalakis;Moshe Babaioff;Hervé Moulin

  • Independent Policy Gradient Methods for Competitive Reinforcement Learning

    Constantinos Daskalakis;Dylan J. Foster;Noah Golowich

Frequent Co-Authors

Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
Ilias Diakonikolas
Ilias Diakonikolas University of Wisconsin–Madison
Rocco A. Servedio
Rocco A. Servedio Columbia University
Gregory Valiant
Gregory Valiant Stanford University
Alexandros G. Dimakis
Alexandros G. Dimakis The University of Texas at Austin
Richard M. Karp
Richard M. Karp University of California, Berkeley
Avinatan Hassidim
Avinatan Hassidim Bar-Ilan University
Mihalis Yannakakis
Mihalis Yannakakis Columbia University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens up a range of flexible educational options. For those seeking a quick path to advancement, shortest master degree programs allow students to earn their qualification in less time, making it easier to balance study and work obligations. These accelerated tracks can be ideal for career changers or professionals looking to upskill rapidly.

Choosing the right program is essential for long-term success. Reviewing the best masters degree to get can guide your decision, ensuring you select a field with strong job growth and high earning potential within and beyond computer science.

If you’re starting your journey or aiming for foundational skills, an associates degree online can be a cost-effective entry point. This option offers flexibility and can often lead directly into the workforce or be a stepping stone towards a bachelor’s.

Affordability is another key consideration. Many institutions now offer affordable online degree programs that make quality education more accessible, helping to minimize student debt and maximize your investment in your future career.

Best Scientists Citing Constantinos Daskalakis

Trending Scientists

Recently Published Articles