Seguir
Constantinos Daskalakis
Constantinos Daskalakis
Professor of Computer Science, MIT
Dirección de correo verificada de csail.mit.edu - Página principal
Título
Citado por
Citado por
Año
The complexity of computing a Nash equilibrium
C Daskalakis, PW Goldberg, CH Papadimitriou
Communications of the ACM 52 (2), 89-97, 2009
20152009
Training gans with optimism
C Daskalakis, A Ilyas, V Syrgkanis, H Zeng
arXiv preprint arXiv:1711.00141, 2017
5312017
The limit points of (optimistic) gradient descent in min-max optimization
C Daskalakis, I Panageas
Advances in neural information processing systems 31, 2018
2862018
Strong duality for a multiple-good monopolist
C Daskalakis, A Deckelbaum, C Tzamos
Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015
2432015
Optimal multi-dimensional mechanism design: Reducing revenue to welfare maximization
Y Cai, C Daskalakis, SM Weinberg
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 130-139, 2012
2182012
Three-player games are hard
C Daskalakis, CH Papadimitriou
Electronic colloquium on computational complexity 139, 81-87, 2005
2112005
The robust manifold defense: Adversarial training using generative models
A Ilyas, A Jalal, E Asteri, C Daskalakis, AG Dimakis
arXiv preprint arXiv:1712.09196, 2017
1912017
An algorithmic characterization of multi-dimensional mechanisms
Y Cai, C Daskalakis, SM Weinberg
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
1832012
Optimal testing for properties of distributions
J Acharya, C Daskalakis, G Kamath
Advances in Neural Information Processing Systems 28, 2015
1712015
Independent policy gradient methods for competitive reinforcement learning
C Daskalakis, DJ Foster, N Golowich
Advances in neural information processing systems 33, 5527-5540, 2020
1702020
Near-optimal no-regret algorithms for zero-sum games
C Daskalakis, A Deckelbaum, A Kim
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
1652011
Last-iterate convergence: Zero-sum games and constrained min-max optimization
C Daskalakis, I Panageas
arXiv preprint arXiv:1807.04252, 2018
1632018
Progress in approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
Proceedings of the 8th ACM Conference on Electronic Commerce, 355-358, 2007
1592007
Optimum statistical estimation with strategic data sources
Y Cai, C Daskalakis, C Papadimitriou
Conference on Learning Theory, 280-296, 2015
1522015
Efficient methods for structured nonconvex-nonconcave min-max optimization
J Diakonikolas, C Daskalakis, MI Jordan
International Conference on Artificial Intelligence and Statistics, 2746-2754, 2021
1442021
The complexity of optimal mechanism design
C Daskalakis, A Deckelbaum, C Tzamos
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1392014
The complexity of constrained min-max optimization
C Daskalakis, S Skoulakis, M Zampetakis
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
1382021
Learning poisson binomial distributions
C Daskalakis, I Diakonikolas, RA Servedio
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
1362012
A note on approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
International Workshop on Internet and Network Economics, 297-306, 2006
1362006
Ten steps of EM suffice for mixtures of two Gaussians
C Daskalakis, C Tzamos, M Zampetakis
Conference on Learning Theory, 704-710, 2017
1322017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20