Constantinos Daskalakis | Academic Influence

Constantinos Daskalakis's AcademicInfluence.com Rankings

Constantinos Daskalakis

Computer Science

#248

World Rank

#259

Historical Rank

Database

#2391

World Rank

#2506

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Constantinos Daskalakis's Degrees

PhD Computer Science University of California, Berkeley
Masters Electrical Engineering and Computer Science University of California, Berkeley
Bachelors Electrical and Computer Engineering National Technical University of Athens

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2024

Why Is Constantinos Daskalakis Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Constantinos Daskalakis is a Greek theoretical computer scientist. 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. He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.

(See a Problem?)

Constantinos Daskalakis's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The complexity of computing a Nash equilibrium (2006) (1107)
The complexity of computing a Nash equilibrium (2009) (464)
Training GANs with Optimism (2017) (408)
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization (2018) (211)
Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization (2012) (208)
A note on approximate Nash equilibria (2006) (186)
Strong Duality for a Multiple-Good Monopolist (2014) (173)
Three-Player Games Are Hard (2005) (170)
An algorithmic characterization of multi-dimensional mechanisms (2011) (164)
The Robust Manifold Defense: Adversarial Training using Generative Models (2017) (156)
Optimal Testing for Properties of Distributions (2015) (145)
Progress in approximate nash equilibria (2007) (138)
Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization (2018) (124)
The Complexity of Optimal Mechanism Design (2012) (116)
Computing Equilibria in Anonymous Games (2007) (108)
Optimum Statistical Estimation with Strategic Data Sources (2014) (106)
Learning Poisson Binomial Distributions (2011) (106)
Understanding Incentives: Mechanism Design Becomes Algorithm Design (2013) (101)
Mechanism design via optimal transport (2013) (99)
Extreme-Value Theorems for Optimal Multidimensional Pricing (2011) (98)
Near-optimal no-regret algorithms for zero-sum games (2011) (97)
Ten Steps of EM Suffice for Mixtures of Two Gaussians (2016) (95)
Optimal phylogenetic reconstruction (2005) (94)
Continuous local search (2011) (90)
Learning k-Modal Distributions via Testing (2011) (89)
Symmetries and optimal multi-dimensional mechanism design (2012) (89)
Testing Ising Models (2016) (87)
On minmax theorems for multiplayer games (2011) (86)
Sorting and Selection in Posets (2007) (86)
Independent Policy Gradient Methods for Competitive Reinforcement Learning (2021) (85)
On the complexity of approximating a Nash equilibrium (2011) (85)
First to market is not everything: an analysis of preferential attachment with fitness (2007) (84)
Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians (2013) (79)
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations (2013) (77)
Computing pure nash equilibria in graphical games via markov random fields (2006) (77)
Testing k-Modal Distributions: Optimal Algorithms via Reductions (2011) (75)
Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization (2020) (74)
On oblivious PTAS's for nash equilibrium (2009) (73)
The complexity of constrained min-max optimization (2020) (71)
Message-Passing Algorithms and Improved LP Decoding (2009) (69)
Evolutionary trees and the Ising model on the Bethe lattice: a proof of Steel’s conjecture (2005) (68)
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems (2020) (64)
Probabilistic Analysis of Linear Programming Decoding (2007) (64)
Optimal and Efficient Parametric Auctions (2013) (58)
Sequential Mechanisms with Ex-post Participation Guarantees (2016) (57)
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (2006) (57)
Learning Multi-Item Auctions with (or without) Samples (2017) (56)
On Learning Algorithms for Nash Equilibria (2010) (54)
Zero-Sum Polymatrix Games: A Generalization of Minmax (2016) (53)
Learning in Auctions: Regret is Hard, Envy is Easy (2015) (53)
On a Network Generalization of the Minmax Theorem (2009) (53)
Approximate Nash equilibria in anonymous games (2015) (52)
Learning Sums of Independent Integer Random Variables (2013) (50)
Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games (2008) (49)
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep (2008) (45)
Priv'IT: Private and Sample Efficient Identity Testing (2017) (45)
Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing (2016) (44)
Tight last-iterate convergence rates for no-regret learning in multi-player games (2020) (43)
How good is the Chord algorithm? (2010) (42)
Near-Optimal No-Regret Learning in General Games (2021) (41)
Learning and Testing Causal Models with Interventions (2018) (41)
Which Distribution Distances are Sublinearly Testable? (2017) (40)
Online Bipartite Perfect Matching With Augmentations (2009) (38)
The Complexity of Games on Highly Regular Graphs (2005) (30)
Multi-item auctions defying intuition? (2015) (30)
A size-free CLT for poisson multinomials and its applications (2015) (30)
Multi-Item Mechanisms without Item-Independence: Learnability via Robustness (2019) (30)
Does Information Revelation Improve Revenue? (2016) (29)
SGD Learns One-Layer Networks in WGANs (2019) (29)
Alignment-Free Phylogenetic Reconstruction (2010) (29)
Testing Poisson Binomial Distributions (2014) (28)
Efficient Statistics, in High Dimensions, from Truncated Samples (2018) (28)
A Counter-example to Karlin's Strong Conjecture for Fictitious Play (2014) (28)
Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms (2014) (27)
Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis (2011) (27)
A Note on Strictly Competitive Games (2009) (27)
Simple, Optimal and Efficient Auctions (2011) (26)
On the Structure, Covering, and Learning of Poisson Multinomial Distributions (2015) (26)
On the complexity of Nash equilibria of action-graph games (2008) (25)
Global Alignment of Molecular Sequences via Ancestral State Reconstruction (2009) (25)
Concentration of Multilinear Functions of the Ising Model with Applications to Network Data (2017) (23)
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games (2021) (23)
A converse to Banach's fixed point theorem and its CLS-completeness (2017) (22)
Regression from dependent observations (2019) (22)
Maximal Accurate Forests from Distance Matrices (2006) (22)
Sparse covers for sums of indicators (2013) (22)
The Complexity of Markov Equilibrium in Stochastic Games (2022) (21)
Learning from weakly dependent data under Dobrushin's condition (2019) (20)
Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms (2012) (20)
On optimal multidimensional mechanism design (2011) (20)
On Optimal Multi-Dimensional Mechanism Design (2011) (19)
Testing Symmetric Markov Chains From a Single Trajectory (2017) (18)
Optimal Pricing Is Hard (2012) (18)
Robust Repeated Auctions under Heterogeneous Buyer Behavior (2018) (17)
A fast and efficient heuristic ESOP minimization algorithm (2004) (17)
Computationally and Statistically Efficient Truncated Regression (2020) (16)
Proceedings of the 2017 ACM Conference on Economics and Computation (2017) (16)
Connectivity and Equilibrium in Random Games (2007) (15)
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons (2018) (15)
An Efficient PTAS for Two-Strategy Anonymous Games (2008) (15)
Revenue Maximization and Ex-Post Budget Constraints (2015) (14)
Score-Guided Intermediate Layer Optimization: Fast Langevin Mixing for Inverse Problems (2022) (13)
Game Theory based Peer Grading Mechanisms for MOOCs (2015) (13)
Computing Pure Nash Equilibria via Markov Random Fields (2005) (13)
HOGWILD!-Gibbs can be PanAccurate (2018) (12)
Nash equilibria: Complexity, symmetries, and approximation (2009) (12)
Fast rates for nonparametric online learning: from realizability to learning in games (2021) (12)
Generative Ensemble-Regression: Learning Stochastic Dynamics from Discrete Particle Ensemble Observations (2020) (11)
Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract) (2015) (10)
Simple, Credible, and Approximately-Optimal Auctions (2020) (10)
Constant-Expansion Suffices for Compressed Sensing with Generative Priors (2020) (10)
More Revenue from Two Samples via Factor Revealing SDPs (2020) (10)
A Theoretical and Practical Framework for Regression and Classification from Truncated Samples (2020) (9)
Estimating Ising Models from One Sample (2020) (9)
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage (2013) (9)
Learning Ising models from one or multiple samples (2020) (9)
Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models (2022) (8)
Truncated Linear Regression in High Dimensions (2020) (8)
Logistic-Regression with peer-group effects via inference in higher order Ising models (2020) (7)
Tree-structured Ising models can be learned efficiently (2020) (6)
GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences (2021) (6)
Optimal Stopping Rules for Sequential Hypothesis Testing (2017) (5)
Statistical Estimation from Dependent Data (2021) (5)
EQUILIBRIA, FIXED POINTS, AND COMPUTATIONAL COMPLEXITY - NEVANLINNA PRIZE LECTURE (2019) (4)
Syrian Refugee Integration in Turkey: Evidence from Call Detail Records (2019) (4)
The Complexity of Nash Equilibria in Multiplayer Zero-Sum Games and Coordination Games (2011) (3)
Sequential Mechanisms with Ex-post Participation (2016) (3)
Efficient Truncated Linear Regression with Unknown Noise Variance (2022) (3)
A Multiplayer Generalization of the MinMax Theorem (2014) (3)
Estimation of Standard Auction Models (2022) (3)
A Statistical Taylor Theorem and Extrapolation of Truncated Densities (2021) (3)
Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent (2023) (3)
Faster Gaussian Processes via Deep Embeddings (2020) (3)
A Constructive Approach to Reduced-Form Auctions with Applications to Multi-Item Mechanism Design (2011) (2)
Revenue Maximization and Ex-Post Budget Constraints (2018) (2)
The Complexity of Hex and the Jordan Curve Theorem (2016) (2)
Subadditivity of Probability Divergences on Bayes-Nets with Applications to Time Series GANs (2020) (2)
Sequential Mechanisms with Ex Post Individual Rationality (2022) (2)
EM's Convergence in Gaussian Latent Tree Models (2022) (2)
Non-Concave Games: A Challenge for Game Theory’s Next 100 Years ∗ (2022) (2)
Recommender Systems meet Mechanism Design (2021) (2)
Reducing Bayesian Mechanism Design to Algorithm Design (2016) (2)
Scalable Gaussian Processes, with Guarantees: Kernel Approximations and Deep Feature Extraction (2020) (2)
What Makes A Good Fisherman? Linear Regression under Self-Selection Bias (2022) (1)
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks (2021) (1)
Learning Poisson Binomial Distributions (Extended Abstract) (2012) (1)
The Application of Data Compression Techniques to Computer Graphics (1982) (1)
Supplementary Material for Priv ’ IT : Priv ate and Sample Efficient I dentity T esting (2017) (1)
Learning transformed product distributions (2011) (1)
Testing from One Sample: Is the casino really using a riffle shuffle? (2017) (1)
6.896 Probability and Computation (2011) (1)
An algorithmic characterization of multi-dimensional mechanisms Citation (2011) (1)
Learning and Testing Latent-Tree Ising Models Efficiently (2022) (1)
Sample-optimal and efficient learning of tree Ising models (2020) (1)
Computing Equilibria in Large Games We Play (2008) (1)
Top-in-at-random Shuffle 1.1 Inverse Top-in-at-random Shuffle (2011) (0)
Lecture 3 : Intro to Deep Learning (2019) (0)
When Do Local Discriminators Work? On Subadditivity of Probability Divergences (2020) (0)
A Framework for Testing Properties of Discrete Distributions: Monotonicity, Independence, and More (2016) (0)
M ar 2 01 5 Mechanism Design via Optimal Transport (2015) (0)
Session details: Session 5A (2010) (0)
Multi-Item Nontruthful Auctions Achieve Good Revenue (2020) (0)
12 55 8 v 1 [ cs . G T ] 2 5 O ct 2 02 1 Recommender Systems meet Mechanism Design (2022) (0)
Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk) (2022) (0)
6.853 Topics in Algorithmic Game Theory September 20, 2011 Lecture 4 (2011) (0)
X Revenue Maximization and Ex-Post Budget Constraints (2015) (0)
On Optimal Multi-Dimensional Mechanism Design Citation (2011) (0)
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games (2022) (0)
.1 Gross-substitutability (2011) (0)
2 Complexity Theory of Total Search Problems (2010) (0)
G T ] 1 0 M ar 2 01 9 Robust Repeated Auctions under Heterogeneous Buyer Behavior (2019) (0)
Explorer Learning Poisson Binomial Distributions (2015) (0)
Learning poisson binomial distributions Citation (2011) (0)
Notes for Lecture 7 1 Increasing the Stretch of Pseudorandom Generators (2005) (0)
MIT Open Access Articles Message-Passing Algorithms and Improved LP Decoding (2022) (0)
• Each player has a utility function up: S → R. (2010) (0)
Sparse covers for sums of indicators (2014) (0)
Species Trees are Recoverable from Unrooted Gene Tree Topologies Under a Constant Rate of Horizontal Gene Transfer (2015) (0)
Lecture 1 . 1 : The Minimax Theorem (2017) (0)
Technical perspective: The quest for optimal multi-item auctions (2021) (0)
Data science in the age of Big Data (2018) (0)
6.896 Topics in Algorithmic Game Theory February 8, 2010 Lecture 2 (2010) (0)
Mechanism Design via Optimal Transport Citation (2015) (0)
Continuous local search Citation (2010) (0)
How Good are Low-Rank Approximations in Gaussian Process Regression? (2020) (0)
Learning Poisson Binomial Distributions (2015) (0)
SDYN-GANs: Adversarial Learning Methods for Multistep Generative Models for General Order Stochastic Dynamics (2023) (0)
Testing Poisson Binomial Distributions Citation (2014) (0)
2 An Example Execution of the Lemke-Howson Algorithm (2013) (0)
Proofs for Probit Regression B . 1 Second derivative for Truncated Probit Regression (2020) (0)
P R ] 15 F eb 2 01 1 Connectivity and Equilibrium in Random Games (2011) (0)
3 Construction of Randomness Extractors (2005) (0)
Notes for Lecture 21 1 Randomized Paging Algorithms (2006) (0)
Lecture 7 2 Application of Path Coupling to Graph Colorings (2011) (0)
Session details: Session 6B (2010) (0)
2 Single-Dimensional Environments (2019) (0)

This paper list is powered by the following services:

Other Resources About Constantinos Daskalakis

What Schools Are Affiliated With Constantinos Daskalakis?

Constantinos Daskalakis is affiliated with the following schools:

Image Attributions

Image Source for Constantinos Daskalakis