Constantinos Daskalakis

According to our database1, Constantinos Daskalakis authored at least 118 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Constant-Expansion Suffices for Compressed Sensing with Generative Priors.
CoRR, 2020

Estimating Ising Models from One Sample.
CoRR, 2020

Faster Gaussian Processes via Deep Embeddings.
CoRR, 2020

Subadditivity of Probability Divergences on Bayes-Nets with Applications to Time Series GANs.
CoRR, 2020

Simple, Credible, and Approximately-Optimal Auctions.
CoRR, 2020

Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems.
CoRR, 2020

A Theoretical and Practical Framework for Regression and Classification from Truncated Samples.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Logistic regression with peer-group effects via inference in higher-order Ising models.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Multi-Item Mechanisms without Item-Independence: Learnability via Robustness.
CoRR, 2019

SGD Learns One-Layer Networks in WGANs.
CoRR, 2019

Regression from dependent observations.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Computationally and Statistically Efficient Truncated Regression.
Proceedings of the Conference on Learning Theory, 2019

Learning from Weakly Dependent Data under Dobrushin's Condition.
Proceedings of the Conference on Learning Theory, 2019

Syrian Refugee Integration in Turkey: Evidence from Call Detail Records.
Proceedings of the Guide to Mobile Data Analytics in Refugee Scenarios, 2019

2018
Revenue Maximization and Ex-Post Budget Constraints.
ACM Trans. Economics and Comput., 2018

Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015).
SIAM J. Comput., 2018

Which Distribution Distances are Sublinearly Testable?
Electronic Colloquium on Computational Complexity (ECCC), 2018

A converse to Banach's fixed point theorem and its CLS-completeness.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Robust Repeated Auctions under Heterogeneous Buyer Behavior.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

HOGWILD!-Gibbs can be PanAccurate.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning and Testing Causal Models with Interventions.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Training GANs with Optimism.
Proceedings of the 6th International Conference on Learning Representations, 2018

Efficient Statistics, in High Dimensions, from Truncated Samples.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Testing Symmetric Markov Chains From a Single Trajectory.
Proceedings of the Conference On Learning Theory, 2018

Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Testing Ising Models.
Electronic Colloquium on Computational Complexity (ECCC), 2017

The Robust Manifold Defense: Adversarial Training using Generative Models.
CoRR, 2017

Testing from One Sample: Is the casino really using a riffle shuffle?
CoRR, 2017

Concentration of Multilinear Functions of the Ising Model with Applications to Network Data.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Priv'IT: Private and Sample Efficient Identity Testing.
Proceedings of the 34th International Conference on Machine Learning, 2017

Learning Multi-Item Auctions with (or without) Samples.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Optimal Stopping Rules for Sequential Hypothesis Testing.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Ten Steps of EM Suffice for Mixtures of Two Gaussians.
Proceedings of the 30th Conference on Learning Theory, 2017

Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Reducing Bayesian Mechanism Design to Algorithm Design.
Encyclopedia of Algorithms, 2016

A Framework for Testing Properties of Discrete Distributions: Monotonicity, Independence, and More.
Tiny Trans. Comput. Sci., 2016

How Good is the Chord Algorithm?
SIAM J. Comput., 2016

Zero-Sum Polymatrix Games: A Generalization of Minmax.
Math. Oper. Res., 2016

A size-free CLT for poisson multinomials and its applications.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Does Information Revelation Improve Revenue?
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Sequential Mechanisms with Ex-post Participation Guarantees.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

The Complexity of Hex and the Jordan Curve Theorem.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Learning in Auctions: Regret is Hard, Envy is Easy.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Multi-item auctions defying intuition?
SIGecom Exch., 2015

Approximate Nash equilibria in anonymous games.
J. Econ. Theory, 2015

Near-optimal no-regret algorithms for zero-sum games.
Games Econ. Behav., 2015

Extreme value theorems for optimal multidimensional pricing.
Games Econ. Behav., 2015

Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound.
CoRR, 2015

Learning Poisson Binomial Distributions.
Algorithmica, 2015

Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Testing Poisson Binomial Distributions.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Strong Duality for a Multiple-Good Monopolist.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Optimal Testing for Properties of Distributions.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Game Theory based Peer Grading Mechanisms for MOOCs.
Proceedings of the Second ACM Conference on Learning @ Scale, 2015

On the Structure, Covering, and Learning of Poisson Multinomial Distributions.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Optimum Statistical Estimation with Strategic Data Sources.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Learning k-Modal Distributions via Testing.
Theory Comput., 2014

Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms.
CoRR, 2014

The Complexity of Optimal Mechanism Design.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A Counter-example to Karlin's Strong Conjecture for Fictitious Play.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
On the Complexity of Approximating a Nash Equilibrium.
ACM Trans. Algorithms, 2013

Sparse Covers for Sums of Indicators.
CoRR, 2013

Testing k-Modal Distributions: Optimal Algorithms via Reductions.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Optimal and Efficient Parametric Auctions.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Mechanism design via optimal transport.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Learning Sums of Independent Integer Random Variables.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Understanding Incentives: Mechanism Design Becomes Algorithm Design.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Message-Passing Algorithms and Improved LP Decoding.
IEEE Trans. Inf. Theory, 2012

Optimal Pricing Is Hard.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Symmetries and optimal multi-dimensional mechanism design.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
On optimal multidimensional mechanism design.
SIGecom Exch., 2011

Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep.
SIAM J. Discret. Math., 2011

Sorting and Selection in Posets.
SIAM J. Comput., 2011

On Optimal Multi-Dimensional Mechanism Design.
Electronic Colloquium on Computational Complexity (ECCC), 2011

An Algorithmic Characterization of Multi-Dimensional Mechanisms.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Testing $k$-Modal Distributions: Optimal Algorithms via Reductions
CoRR, 2011

Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis
CoRR, 2011

Learning $k$-Modal Distributions via Testing
CoRR, 2011

Learning transformed product distributions
CoRR, 2011

Simple, Optimal and Efficient Auctions.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Continuous Local Search.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

On Minmax Theorems for Multiplayer Games.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
On Learning Algorithms for Nash Equilibria.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Alignment-Free Phylogenetic Reconstruction.
Proceedings of the Research in Computational Molecular Biology, 2010

Global Alignment of Molecular Sequences via Ancestral State Reconstruction.
Proceedings of the Innovations in Computer Science, 2010

2009
A note on approximate Nash equilibria.
Theor. Comput. Sci., 2009

Nash equilibria: Complexity, symmetries, and approximation.
Comput. Sci. Rev., 2009

A Note on Strictly Competitive Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On oblivious PTAS's for nash equilibrium.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

On the complexity of Nash equilibria of action-graph games.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Online Bipartite Perfect Matching With Augmentations.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

On a Network Generalization of the Minmax Theorem.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Probabilistic Analysis of Linear Programming Decoding.
IEEE Trans. Inf. Theory, 2008

An Efficient PTAS for Two-Strategy Anonymous Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Computing Equilibria in Large Games We Play.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Connectivity and Equilibrium in Random Games
CoRR, 2007

First to market is not everything: an analysis of preferential attachment with fitness.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Progress in approximate nash equilibria.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Computing Equilibria in Anonymous Games.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Optimal phylogenetic reconstruction.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Computing pure nash equilibria in graphical games via markov random fields.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Maximal Accurate Forests from Distance Matrices.
Proceedings of the Research in Computational Molecular Biology, 2006

The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Three-Player Games Are Hard
Electronic Colloquium on Computational Complexity (ECCC), 2005

The complexity of computing a Nash equilibrium
Electronic Colloquium on Computational Complexity (ECCC), 2005

Computing Pure Nash Equilibria via Markov Random Fields
CoRR, 2005

Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel's Conjecture.
CoRR, 2005

The Complexity of Games on Highly Regular Graphs.
Proceedings of the Algorithms, 2005

2004
A fast and efficient heuristic ESOP minimization algorithm.
Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, 2004


  Loading...