default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConstantinos Daskalakis
Konstantinos Daskalakis – Costis Daskalakis
Person information
- affiliation: MIT
- affiliation (former): University of California, Berkeley, USA
- award (2018): Grace Murray Hopper Award
- award: Nevanlinna Prize, 2018
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c125]Fan Chen, Constantinos Daskalakis, Noah Golowich, Alexander Rakhlin:
Near-Optimal Learning and Planning in Separated Latent MDPs. COLT 2024: 995-1067- [c124]Constantinos Daskalakis, Noah Golowich:
Is Efficient PAC Learning Possible with an Oracle That Responds "Yes" or "No"? COLT 2024: 1263-1307 - [c123]Giannis Daras, Alex Dimakis, Constantinos Daskalakis:
Consistent Diffusion Meets Tweedie: Training Exact Ambient Diffusion Models with Noisy Data. ICML 2024 - [c122]Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, Abhishek Shetty:
Smooth Nash Equilibria: Algorithms and Complexity. ITCS 2024: 37:1-37:22 - [c121]Yuval Dagan
, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich:
From External to Swap Regret 2.0: An Efficient Reduction for Large Action Spaces. STOC 2024: 1216-1222 - [i116]Yang Cai, Constantinos Daskalakis, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng:
Tractable Local Equilibria in Non-Concave Games. CoRR abs/2403.08171 (2024) - [i115]Giannis Daras, Alexandros G. Dimakis, Constantinos Daskalakis:
Consistent Diffusion Meets Tweedie: Training Exact Ambient Diffusion Models with Noisy Data. CoRR abs/2404.10177 (2024) - [i114]Fan Chen, Constantinos Daskalakis, Noah Golowich, Alexander Rakhlin:
Near-Optimal Learning and Planning in Separated Latent MDPs. CoRR abs/2406.07920 (2024) - [i113]Constantinos Daskalakis, Noah Golowich:
Is Efficient PAC Learning Possible with an Oracle That Responds 'Yes' or 'No'? CoRR abs/2406.11667 (2024) - [i112]Constantinos Daskalakis, Gabriele Farina, Noah Golowich, Tuomas Sandholm, Brian Hu Zhang:
A Lower Bound on Swap Regret in Extensive-Form Games. CoRR abs/2406.13116 (2024) - [i111]Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich, Robert Kleinberg, Princewill Okoroafor:
Improved bounds for calibration via stronger sign preservation games. CoRR abs/2406.13668 (2024) - [i110]Angelos Assos, Yuval Dagan, Constantinos Daskalakis:
Maximizing utility in multi-agent environments by anticipating the behavior of other learners. CoRR abs/2407.04889 (2024) - [i109]Giannis Daras, Yeshwanth Cherapanamjeri, Constantinos Daskalakis:
How much is a noisy image worth? Data Scaling Laws for Ambient Diffusion. CoRR abs/2411.02780 (2024) - [i108]Anthimos Vardis Kandiros, Charilaos Pipis, Constantinos Daskalakis, Christopher Harshaw:
The Conflict Graph Design: Estimating Causal Effects under Arbitrary Neighborhood Interference. CoRR abs/2411.10908 (2024) - [i107]Constantinos Daskalakis, Ian Gemp, Yanchen Jiang, Renato Paes Leme, Christos H. Papadimitriou, Georgios Piliouras:
Charting the Shapes of Stories with Game Theory. CoRR abs/2412.05747 (2024) - [i106]Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Charilaos Pipis, Jon Schneider:
Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games. CoRR abs/2412.20291 (2024) - 2023
- [j26]Itai Ashlagi, Constantinos Daskalakis, Nima Haghpanah:
Sequential Mechanisms with Ex Post Individual Rationality. Oper. Res. 71(1): 245-258 (2023) - [c120]Angelos Assos, Idan Attias, Yuval Dagan, Constantinos Daskalakis, Maxwell K. Fishelson:
Online Learning and Solving Infinite Games with an ERM Oracle. COLT 2023: 274-324 - [c119]Anthimos Vardis Kandiros, Constantinos Daskalakis, Yuval Dagan, Davin Choo:
Learning and Testing Latent-Tree Ising Models Efficiently. COLT 2023: 1666-1729 - [c118]Constantinos Daskalakis, Noah Golowich, Kaiqing Zhang:
The Complexity of Markov Equilibrium in Stochastic Games. COLT 2023: 4180-4234 - [c117]Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis, Emmanouil Zampetakis:
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games. COLT 2023: 5146-5198 - [c116]Giannis Daras, Yuval Dagan, Alex Dimakis, Constantinos Daskalakis:
Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent. NeurIPS 2023 - [c115]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
What Makes a Good Fisherman? Linear Regression under Self-Selection Bias. STOC 2023: 1699-1712 - [i105]Panos Stinis, Constantinos Daskalakis, Paul J. Atzberger:
SDYN-GANs: Adversarial Learning Methods for Multistep Generative Models for General Order Stochastic Dynamics. CoRR abs/2302.03663 (2023) - [i104]Giannis Daras, Yuval Dagan, Alexandros G. Dimakis, Constantinos Daskalakis:
Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent. CoRR abs/2302.09057 (2023) - [i103]Angelos Assos, Idan Attias, Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson:
Online Learning and Solving Infinite Games with an ERM Oracle. CoRR abs/2307.01689 (2023) - [i102]Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, Abhishek Shetty:
Smooth Nash Equilibria: Algorithms and Complexity. CoRR abs/2309.12226 (2023) - [i101]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. CoRR abs/2310.19786 (2023) - 2022
- [j25]Constantinos Daskalakis, Vasilis Syrgkanis:
Learning in auctions: Regret is hard, envy is easy. Games Econ. Behav. 134: 308-343 (2022) - [j24]Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy:
Multi-Item Nontruthful Auctions Achieve Good Revenue. SIAM J. Comput. 51(6): 1796-1838 (2022) - [j23]Liu Yang, Constantinos Daskalakis, George E. Karniadakis:
Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models. SIAM J. Sci. Comput. 44(1): 80- (2022) - [c114]Constantinos Daskalakis, Petros Dellaportas, Aristeidis Panos:
How Good Are Low-Rank Approximations in Gaussian Process Regression? AAAI 2022: 6463-6470 - [c113]Yuval Dagan, Anthimos Vardis Kandiros, Constantinos Daskalakis:
EM's Convergence in Gaussian Latent Tree Models. COLT 2022: 2597-2667 - [c112]Constantinos Daskalakis:
Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk). ICALP 2022: 2:1-2:1 - [c111]Giannis Daras, Yuval Dagan, Alex Dimakis, Constantinos Daskalakis:
Score-Guided Intermediate Level Optimization: Fast Langevin Mixing for Inverse Problems. ICML 2022: 4722-4753 - [c110]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
Estimation of Standard Auction Models. EC 2022: 602-603 - [c109]Yang Cai, Constantinos Daskalakis:
Recommender Systems meet Mechanism Design. EC 2022: 897-914 - [c108]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. STOC 2022: 736-749 - [c107]Constantinos Daskalakis, Noah Golowich:
Fast rates for nonparametric online learning: from realizability to learning in games. STOC 2022: 846-859 - [i100]Constantinos Daskalakis, Noah Golowich, Kaiqing Zhang:
The Complexity of Markov Equilibrium in Stochastic Games. CoRR abs/2204.03991 (2022) - [i99]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
Estimation of Standard Auction Models. CoRR abs/2205.02060 (2022) - [i98]Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis:
What Makes A Good Fisherman? Linear Regression under Self-Selection Bias. CoRR abs/2205.03246 (2022) - [i97]Giannis Daras, Yuval Dagan, Alexandros G. Dimakis, Constantinos Daskalakis:
Score-Guided Intermediate Layer Optimization: Fast Langevin Mixing for Inverse Problems. CoRR abs/2206.09104 (2022) - [i96]Constantinos Daskalakis, Patroklos Stefanou, Rui Yao, Manolis Zampetakis:
Efficient Truncated Linear Regression with Unknown Noise Variance. CoRR abs/2208.12042 (2022) - [i95]Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis, Manolis Zampetakis:
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games. CoRR abs/2210.09769 (2022) - [i94]Yuval Dagan, Constantinos Daskalakis, Anthimos Vardis Kandiros:
EM's Convergence in Gaussian Latent Tree Models. CoRR abs/2211.11904 (2022) - [i93]Davin Choo, Yuval Dagan, Constantinos Daskalakis, Anthimos Vardis Kandiros:
Learning and Testing Latent-Tree Ising Models Efficiently. CoRR abs/2211.13291 (2022) - 2021
- [j22]Constantinos Daskalakis:
Technical perspective: The quest for optimal multi-item auctions. Commun. ACM 64(8): 108 (2021) - [c106]Fotini Christia, Michael J. Curry, Constantinos Daskalakis, Erik D. Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff:
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. AAAI 2021: 5277-5285 - [c105]Jelena Diakonikolas, Constantinos Daskalakis, Michael I. Jordan:
Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization. AISTATS 2021: 2746-2754 - [c104]Mucong Ding, Constantinos Daskalakis, Soheil Feizi:
GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences. AISTATS 2021: 3709-3717 - [c103]Constantinos Daskalakis, Vasilis Kontonis, Christos Tzamos, Emmanouil Zampetakis:
A Statistical Taylor Theorem and Extrapolation of Truncated Densities. COLT 2021: 1395-1398 - [c102]Anthimos Vardis Kandiros, Yuval Dagan, Nishanth Dikkala, Surbhi Goel, Constantinos Daskalakis:
Statistical Estimation from Dependent Data. ICML 2021: 5269-5278 - [c101]Constantinos Daskalakis, Patroklos Stefanou, Rui Yao, Emmanouil Zampetakis:
Efficient Truncated Linear Regression with Unknown Noise Variance. NeurIPS 2021: 1952-1963 - [c100]Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich:
Near-Optimal No-Regret Learning in General Games. NeurIPS 2021: 27604-27616 - [c99]Constantinos Daskalakis, Qinxuan Pan:
Sample-optimal and efficient learning of tree Ising models. STOC 2021: 133-146 - [c98]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Anthimos Vardis Kandiros:
Learning Ising models from one or multiple samples. STOC 2021: 161-168 - [c97]Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis:
The complexity of constrained min-max optimization. STOC 2021: 1466-1478 - [i92]Constantinos Daskalakis, Dylan J. Foster, Noah Golowich:
Independent Policy Gradient Methods for Competitive Reinforcement Learning. CoRR abs/2101.04233 (2021) - [i91]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Surbhi Goel, Anthimos Vardis Kandiros:
Statistical Estimation from Dependent Data. CoRR abs/2107.09773 (2021) - [i90]Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich:
Near-Optimal No-Regret Learning in General Games. CoRR abs/2108.06924 (2021) - [i89]Yang Cai, Constantinos Daskalakis:
Recommender Systems meet Mechanism Design. CoRR abs/2110.12558 (2021) - [i88]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. CoRR abs/2111.06008 (2021) - [i87]Constantinos Daskalakis, Noah Golowich:
Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games. CoRR abs/2111.08911 (2021) - 2020
- [c96]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Logistic regression with peer-group effects via inference in higher-order Ising models. AISTATS 2020: 3653-3663 - [c95]Andrew Ilyas, Emmanouil Zampetakis, Constantinos Daskalakis:
A Theoretical and Practical Framework for Regression and Classification from Truncated Samples. AISTATS 2020: 4463-4473 - [c94]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, Asuman E. Ozdaglar:
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems. COLT 2020: 1758-1784 - [c93]Qi Lei, Jason D. Lee, Alex Dimakis, Constantinos Daskalakis:
SGD Learns One-Layer Networks in WGANs. ICML 2020: 5799-5808 - [c92]Constantinos Daskalakis, Dylan J. Foster, Noah Golowich:
Independent Policy Gradient Methods for Competitive Reinforcement Learning. NeurIPS 2020 - [c91]Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis:
Truncated Linear Regression in High Dimensions. NeurIPS 2020 - [c90]Constantinos Daskalakis, Dhruv Rohatgi, Emmanouil Zampetakis:
Constant-Expansion Suffices for Compressed Sensing with Generative Priors. NeurIPS 2020 - [c89]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis:
Tight last-iterate convergence rates for no-regret learning in multi-player games. NeurIPS 2020 - [c88]Constantinos Daskalakis, Manolis Zampetakis:
More Revenue from Two Samples via Factor Revealing SDPs. EC 2020: 257-272 - [c87]Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy:
Simple, Credible, and Approximately-Optimal Auctions. EC 2020: 713 - [c86]Johannes Brustle, Yang Cai, Constantinos Daskalakis:
Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. EC 2020: 715-761 - [i86]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, Asuman E. Ozdaglar:
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems. CoRR abs/2002.00057 (2020) - [i85]Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy:
Simple, Credible, and Approximately-Optimal Auctions. CoRR abs/2002.06702 (2020) - [i84]Mucong Ding, Constantinos Daskalakis, Soheil Feizi:
Subadditivity of Probability Divergences on Bayes-Nets with Applications to Time Series GANs. CoRR abs/2003.00652 (2020) - [i83]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Logistic-Regression with peer-group effects via inference in higher order Ising models. CoRR abs/2003.08259 (2020) - [i82]Constantinos Daskalakis, Petros Dellaportas, Aristeidis Panos:
Faster Gaussian Processes via Deep Embeddings. CoRR abs/2004.01584 (2020) - [i81]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Anthimos Vardis Kandiros:
Estimating Ising Models from One Sample. CoRR abs/2004.09370 (2020) - [i80]Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis:
Constant-Expansion Suffices for Compressed Sensing with Generative Priors. CoRR abs/2006.04237 (2020) - [i79]Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis:
Truncated Linear Regression in High Dimensions. CoRR abs/2007.14539 (2020) - [i78]Liu Yang, Constantinos Daskalakis, George Em Karniadakis:
Generative Ensemble-Regression: Learning Stochastic Dynamics from Discrete Particle Ensemble Observations. CoRR abs/2008.01915 (2020) - [i77]Constantinos Daskalakis, Stratis Skoulakis, Manolis Zampetakis:
The Complexity of Constrained Min-Max Optimization. CoRR abs/2009.09623 (2020) - [i76]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Computationally and Statistically Efficient Truncated Regression. CoRR abs/2010.12000 (2020) - [i75]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis:
Tight last-iterate convergence rates for no-regret learning in multi-player games. CoRR abs/2010.13724 (2020) - [i74]Constantinos Daskalakis, Qinxuan Pan:
Tree-structured Ising models can be learned efficiently. CoRR abs/2010.14864 (2020) - [i73]Jelena Diakonikolas, Constantinos Daskalakis, Michael I. Jordan:
Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization. CoRR abs/2011.00364 (2020)
2010 – 2019
- 2019
- [j21]Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Testing Ising Models. IEEE Trans. Inf. Theory 65(11): 6829-6852 (2019) - [c85]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
Learning from Weakly Dependent Data under Dobrushin's Condition. COLT 2019: 914-928 - [c84]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Computationally and Statistically Efficient Truncated Regression. COLT 2019: 955-960 - [c83]Constantinos Daskalakis, Ioannis Panageas:
Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. ITCS 2019: 27:1-27:18 - [c82]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Regression from dependent observations. STOC 2019: 881-889 - [p1]Tugba Bozcaga, Fotini Christia, Elizabeth Harwood, Constantinos Daskalakis, Christos Papademetriou:
Syrian Refugee Integration in Turkey: Evidence from Call Detail Records. Data for Refugees Challenge 2019: 223-249 - [i72]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Regression from Dependent Observations. CoRR abs/1905.03353 (2019) - [i71]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
Learning from weakly dependent data under Dobrushin's condition. CoRR abs/1906.09247 (2019) - [i70]Qi Lei, Jason D. Lee, Alexandros G. Dimakis, Constantinos Daskalakis:
SGD Learns One-Layer Networks in WGANs. CoRR abs/1910.07030 (2019) - [i69]Johannes Brustle, Yang Cai, Constantinos Daskalakis:
Multi-Item Mechanisms without Item-Independence: Learnability via Robustness. CoRR abs/1911.02146 (2019) - 2018
- [j20]Costis Daskalakis, Yael Kalai, Sandy Irani:
Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015). SIAM J. Comput. 47(3): 888-889 (2018) - [j19]Constantinos Daskalakis, Nikhil R. Devanur, S. Matthew Weinberg:
Revenue Maximization and Ex-Post Budget Constraints. ACM Trans. Economics and Comput. 6(3-4): 20:1-20:19 (2018) - [c81]Costis Daskalakis, Christos Tzamos, Manolis Zampetakis:
Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model. AISTATS 2018: 2056-2064 - [c80]Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin:
Testing Symmetric Markov Chains From a Single Trajectory. COLT 2018: 385-409 - [c79]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Efficient Statistics, in High Dimensions, from Truncated Samples. FOCS 2018: 639-649 - [c78]Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, Haoyang Zeng:
Training GANs with Optimism. ICLR (Poster) 2018 - [c77]Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
HOGWILD!-Gibbs can be PanAccurate. NeurIPS 2018: 32-41 - [c76]Constantinos Daskalakis, Ioannis Panageas:
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization. NeurIPS 2018: 9256-9266 - [c75]Jayadev Acharya, Arnab Bhattacharyya, Constantinos Daskalakis, Saravanan Kandasamy:
Learning and Testing Causal Models with Interventions. NeurIPS 2018: 9469-9481 - [c74]Nima Anari, Constantinos Daskalakis, Wolfgang Maass, Christos H. Papadimitriou, Amin Saberi, Santosh S. Vempala:
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons. NeurIPS 2018: 10880-10890 - [c73]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. EC 2018: 171 - [c72]Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Testing Ising Models. SODA 2018: 1989-2007 - [c71]Constantinos Daskalakis, Gautam Kamath, John Wright:
Which Distribution Distances are Sublinearly Testable? SODA 2018: 2747-2764 - [c70]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
A converse to Banach's fixed point theorem and its CLS-completeness. STOC 2018: 44-50 - [i68]Shipra Agrawal, Constantinos Daskalakis, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated Auctions under Heterogeneous Buyer Behavior. CoRR abs/1803.00494 (2018) - [i67]Jayadev Acharya, Arnab Bhattacharyya, Constantinos Daskalakis, Saravanan Kandasamy:
Learning and Testing Causal Models with Interventions. CoRR abs/1805.09697 (2018) - [i66]Constantinos Daskalakis, Ioannis Panageas:
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization. CoRR abs/1807.03907 (2018) - [i65]Constantinos Daskalakis, Ioannis Panageas:
Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. CoRR abs/1807.04252 (2018) - [i64]Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis:
Efficient Statistics, in High Dimensions, from Truncated Samples. CoRR abs/1809.03986 (2018) - [i63]Nima Anari, Constantinos Daskalakis, Wolfgang Maass, Christos H. Papadimitriou, Amin Saberi, Santosh S. Vempala:
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons. CoRR abs/1810.11896 (2018) - [i62]Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti:
HOGWILD!-Gibbs can be PanAccurate. CoRR abs/1811.10581 (2018) - [i61]Constantinos Daskalakis, Gautam Kamath, John Wright:
Which Distribution Distances are Sublinearly Testable? Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c69]Constantinos Daskalakis, Qinxuan Pan:
Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing. COLT 2017: 697-703 - [c68]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
Ten Steps of EM Suffice for Mixtures of Two Gaussians. COLT 2017: 704-710 - [c67]Constantinos Daskalakis, Yasushi Kawase:
Optimal Stopping Rules for Sequential Hypothesis Testing. ESA 2017: 32:1-32:14 - [c66]Yang Cai, Constantinos Daskalakis:
Learning Multi-Item Auctions with (or without) Samples. FOCS 2017: 516-527 - [c65]Bryan Cai, Constantinos Daskalakis, Gautam Kamath:
Priv'IT: Private and Sample Efficient Identity Testing. ICML 2017: 635-644 - [c64]Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Concentration of Multilinear Functions of the Ising Model with Applications to Network Data. NIPS 2017: 12-23 - [e1]Constantinos Daskalakis, Moshe Babaioff, Hervé Moulin:
Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17, Cambridge, MA, USA, June 26-30, 2017. ACM 2017, ISBN 978-1-4503-4527-9 [contents] - [i60]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
A Converse to Banach's Fixed Point Theorem and its CLS Completeness. CoRR abs/1702.07339 (2017) - [i59]Bryan Cai, Constantinos Daskalakis, Gautam Kamath:
Priv'IT: Private and Sample Efficient Identity Testing. CoRR abs/1703.10127 (2017) - [i58]Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin:
Testing from One Sample: Is the casino really using a riffle shuffle? CoRR abs/1704.06850 (2017) - [i57]Constantinos Daskalakis, Gautam Kamath, John Wright:
Which Distribution Distances are Sublinearly Testable? CoRR abs/1708.00002 (2017) - [i56]Yang Cai, Constantinos Daskalakis:
Learning Multi-item Auctions with (or without) Samples. CoRR abs/1709.00228 (2017) - [i55]Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Concentration of Multilinear Functions of the Ising Model with Applications to Network Data. CoRR abs/1710.04170 (2017) - [i54]Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, Haoyang Zeng:
Training GANs with Optimism. CoRR abs/1711.00141 (2017) - [i53]Andrew Ilyas, Ajil Jalal, Eirini Asteri, Constantinos Daskalakis, Alexandros G. Dimakis:
The Robust Manifold Defense: Adversarial Training using Generative Models. CoRR abs/1712.09196 (2017) - [i52]Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Testing Ising Models. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j18]Yang Cai, Ozan Candogan, Constantinos Daskalakis, Christos H. Papadimitriou:
Zero-Sum Polymatrix Games: A Generalization of Minmax. Math. Oper. Res. 41(2): 648-655 (2016) - [j17]Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis:
How Good is the Chord Algorithm? SIAM J. Comput. 45(3): 811-858 (2016) - [c63]Constantinos Daskalakis, Vasilis Syrgkanis:
Learning in Auctions: Regret is Hard, Envy is Easy. FOCS 2016: 219-228 - [c62]Aviv Adler, Constantinos Daskalakis, Erik D. Demaine:
The Complexity of Hex and the Jordan Curve Theorem. ICALP 2016: 24:1-24:14 - [c61]Itai Ashlagi, Constantinos Daskalakis, Nima Haghpanah:
Sequential Mechanisms with Ex-post Participation Guarantees. EC 2016: 213-214 - [c60]Constantinos Daskalakis, Christos H. Papadimitriou, Christos Tzamos:
Does Information Revelation Improve Revenue? EC 2016: 233-250 - [c59]Constantinos Daskalakis, Sebastien Roch:
Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract). SODA 2016: 1621-1630 - [c58]Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos:
A size-free CLT for poisson multinomials and its applications. STOC 2016: 1074-1086 - [r1]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Reducing Bayesian Mechanism Design to Algorithm Design. Encyclopedia of Algorithms 2016: 1801-1808 - [i51]Itai Ashlagi, Constantinos Daskalakis, Nima Haghpanah:
Sequential Mechanisms with ex-post Participation Guarantees. CoRR abs/1603.07229 (2016) - [i50]Constantinos Daskalakis, Nikhil R. Devanur, S. Matthew Weinberg:
Revenue Maximization and Ex-Post Budget Constraints. CoRR abs/1605.02054 (2016) - [i49]Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis:
Ten Steps of EM Suffice for Mixtures of Two Gaussians. CoRR abs/1609.00368 (2016) - [i48]Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Testing Ising Models. CoRR abs/1612.03147 (2016) - [i47]Constantinos Daskalakis, Qinxuan Pan:
Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing. CoRR abs/1612.03164 (2016) - [i46]Jayadev Acharya, Constantinos Daskalakis, Gautam Kamath:
A Framework for Testing Properties of Discrete Distributions: Monotonicity, Independence, and More. Adv. Math. Commun. 4 (2016) - 2015
- [j16]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning Poisson Binomial Distributions. Algorithmica 72(1): 316-357 (2015) - [j15]Yang Cai, Constantinos Daskalakis:
Extreme value theorems for optimal multidimensional pricing. Games Econ. Behav. 92: 266-305 (2015) - [j14]Constantinos Daskalakis, Alan Deckelbaum, Anthony Kim:
Near-optimal no-regret algorithms for zero-sum games. Games Econ. Behav. 92: 327-348 (2015) - [j13]Constantinos Daskalakis, Christos H. Papadimitriou:
Approximate Nash equilibria in anonymous games. J. Econ. Theory 156: 207-245 (2015) - [j12]Constantinos Daskalakis:
Multi-item auctions defying intuition? SIGecom Exch. 14(1): 41-75 (2015) - [c57]Yang Cai, Constantinos Daskalakis, Christos H. Papadimitriou:
Optimum Statistical Estimation with Strategic Data Sources. COLT 2015: 280-296 - [c56]Constantinos Daskalakis, Gautam Kamath, Christos Tzamos:
On the Structure, Covering, and Learning of Poisson Multinomial Distributions. FOCS 2015: 1203-1217 - [c55]William Wu, Constantinos Daskalakis, Nicolaas Kaashoek, Christos Tzamos, S. Matthew Weinberg:
Game Theory based Peer Grading Mechanisms for MOOCs. L@S 2015: 281-286 - [c54]Jayadev Acharya, Constantinos Daskalakis, Gautam Kamath:
Optimal Testing for Properties of Distributions. NIPS 2015: 3591-3599 - [c53]Constantinos Daskalakis, Nikhil R. Devanur, S. Matthew Weinberg:
Revenue Maximization and Ex-Post Budget Constraints. EC 2015: 433-447 - [c52]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Strong Duality for a Multiple-Good Monopolist. EC 2015: 449-450 - [c51]Jayadev Acharya, Constantinos Daskalakis:
Testing Poisson Binomial Distributions. SODA 2015: 1829-1840 - [c50]Constantinos Daskalakis, S. Matthew Weinberg:
Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms. SODA 2015: 1934-1952 - [i45]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Mechanism Design via Optimal Transport. CoRR abs/1503.01958 (2015) - [i44]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Optimal Pricing is Hard. CoRR abs/1503.02516 (2015) - [i43]Constantinos Daskalakis, Gautam Kamath, Christos Tzamos:
On the Structure, Covering, and Learning of Poisson Multinomial Distributions. CoRR abs/1504.08363 (2015) - [i42]Jayadev Acharya, Constantinos Daskalakis, Gautam Kamath:
Optimal Testing for Properties of Distributions. CoRR abs/1507.05952 (2015) - [i41]Constantinos Daskalakis, Sébastien Roch:
Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound. CoRR abs/1508.01962 (2015) - [i40]Constantinos Daskalakis, Vasilis Syrgkanis:
Learning in Auctions: Regret is Hard, Envy is Easy. CoRR abs/1511.01411 (2015) - [i39]Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos:
A Size-Free CLT for Poisson Multinomials and its Applications. CoRR abs/1511.03641 (2015) - 2014
- [j11]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning k-Modal Distributions via Testing. Theory Comput. 10: 535-570 (2014) - [c49]Constantinos Daskalakis, Gautam Kamath:
Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians. COLT 2014: 1183-1213 - [c48]Constantinos Daskalakis, Qinxuan Pan:
A Counter-example to Karlin's Strong Conjecture for Fictitious Play. FOCS 2014: 11-20 - [c47]Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio:
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. SODA 2014: 628-644 - [c46]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
The Complexity of Optimal Mechanism Design. SODA 2014: 1302-1318 - [i38]Constantinos Daskalakis, S. Matthew Weinberg:
Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms. CoRR abs/1405.5940 (2014) - [i37]Yang Cai, Constantinos Daskalakis, Christos H. Papadimitriou:
Optimum Statistical Estimation with Strategic Data Sources. CoRR abs/1408.2539 (2014) - [i36]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Strong Duality for a Multiple-Good Monopolist. CoRR abs/1409.4150 (2014) - [i35]Jayadev Acharya, Constantinos Daskalakis:
Testing Poisson Binomial Distributions. CoRR abs/1410.3386 (2014) - [i34]Constantinos Daskalakis, Qinxuan Pan:
A Counter-Example to Karlin's Strong Conjecture for Fictitious Play. CoRR abs/1412.4840 (2014) - 2013
- [j10]Constantinos Daskalakis:
On the Complexity of Approximating a Nash Equilibrium. ACM Trans. Algorithms 9(3): 23:1-23:35 (2013) - [c45]Constantinos Daskalakis, Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
Learning Sums of Independent Integer Random Variables. FOCS 2013: 217-226 - [c44]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Understanding Incentives: Mechanism Design Becomes Algorithm Design. FOCS 2013: 618-627 - [c43]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Mechanism design via optimal transport. EC 2013: 269-286 - [c42]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations. SODA 2013: 578-595 - [c41]Pablo Daniel Azar, Constantinos Daskalakis, Silvio Micali, S. Matthew Weinberg:
Optimal and Efficient Parametric Auctions. SODA 2013: 596-604 - [c40]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant:
Testing k-Modal Distributions: Optimal Algorithms via Reductions. SODA 2013: 1833-1852 - [i33]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations. CoRR abs/1305.4000 (2013) - [i32]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Understanding Incentives: Mechanism Design becomes Algorithm Design. CoRR abs/1305.4002 (2013) - [i31]Constantinos Daskalakis, Christos H. Papadimitriou:
Sparse Covers for Sums of Indicators. CoRR abs/1306.1265 (2013) - [i30]Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio:
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. CoRR abs/1307.3621 (2013) - [i29]Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis:
How good is the Chord algorithm? CoRR abs/1309.7084 (2013) - [i28]Constantinos Daskalakis, Gautam Kamath:
Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians. CoRR abs/1312.1054 (2013) - 2012
- [j9]Sanjeev Arora, Constantinos Daskalakis, David Steurer:
Message-Passing Algorithms and Improved LP Decoding. IEEE Trans. Inf. Theory 58(12): 7260-7271 (2012) - [c39]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization. FOCS 2012: 130-139 - [c38]Constantinos Daskalakis, S. Matthew Weinberg:
Symmetries and optimal multi-dimensional mechanism design. EC 2012: 370-387 - [c37]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning k-modal distributions via testing. SODA 2012: 1371-1385 - [c36]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
An algorithmic characterization of multi-dimensional mechanisms. STOC 2012: 459-478 - [c35]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning poisson binomial distributions. STOC 2012: 709-728 - [c34]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
Optimal Pricing Is Hard. WINE 2012: 298-308 - [i27]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Optimal Multi-Dimensional Mechanism Design: Reducing Revenue to Welfare Maximization. CoRR abs/1207.5518 (2012) - [i26]Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos:
The Complexity of Optimal Mechanism Design. CoRR abs/1211.1703 (2012) - 2011
- [j8]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. SIAM J. Comput. 40(3): 597-622 (2011) - [j7]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. SIAM J. Discret. Math. 25(2): 872-893 (2011) - [j6]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
On optimal multidimensional mechanism design. SIGecom Exch. 10(2): 29-33 (2011) - [c33]Yang Cai, Constantinos Daskalakis:
Extreme-Value Theorems for Optimal Multidimensional Pricing. FOCS 2011: 522-531 - [c32]Yang Cai, Constantinos Daskalakis:
On Minmax Theorems for Multiplayer Games. SODA 2011: 217-234 - [c31]Constantinos Daskalakis, Alan Deckelbaum, Anthony Kim:
Near-Optimal No-Regret Algorithms for Zero-Sum Games. SODA 2011: 235-254 - [c30]Constantinos Daskalakis, Christos H. Papadimitriou:
Continuous Local Search. SODA 2011: 790-804 - [c29]Constantinos Daskalakis:
On the Complexity of Approximating a Nash Equilibrium. SODA 2011: 1498-1517 - [c28]Constantinos Daskalakis, George Pierrakos:
Simple, Optimal and Efficient Auctions. WINE 2011: 109-121 - [i25]Constantinos Daskalakis, Christos H. Papadimitriou:
On Oblivious PTAS's for Nash Equilibrium. CoRR abs/1102.2280 (2011) - [i24]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning transformed product distributions. CoRR abs/1103.0598 (2011) - [i23]Yang Cai, Constantinos Daskalakis:
Extreme-Value Theorems for Optimal Multidimensional Pricing. CoRR abs/1106.0519 (2011) - [i22]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning $k$-Modal Distributions via Testing. CoRR abs/1107.2700 (2011) - [i21]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning Poisson Binomial Distributions. CoRR abs/1107.2702 (2011) - [i20]Constantinos Daskalakis, Sébastien Roch:
Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis. CoRR abs/1109.5002 (2011) - [i19]Constantinos Daskalakis, S. Matthew Weinberg:
On Optimal Multi-Dimensional Mechanism Design. CoRR abs/1112.4006 (2011) - [i18]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
An Algorithmic Characterization of Multi-Dimensional Mechanisms. CoRR abs/1112.4572 (2011) - [i17]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant:
Testing $k$-Modal Distributions: Optimal Algorithms via Reductions. CoRR abs/1112.5659 (2011) - [i16]Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
An Algorithmic Characterization of Multi-Dimensional Mechanisms. Electron. Colloquium Comput. Complex. TR11 (2011) - [i15]Constantinos Daskalakis, S. Matthew Weinberg:
On Optimal Multi-Dimensional Mechanism Design. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c27]Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch:
Global Alignment of Molecular Sequences via Ancestral State Reconstruction. ICS 2010: 358-369 - [c26]Constantinos Daskalakis, Sébastien Roch:
Alignment-Free Phylogenetic Reconstruction. RECOMB 2010: 123-137 - [c25]Constantinos Daskalakis, Rafael M. Frongillo, Christos H. Papadimitriou, George Pierrakos, Gregory Valiant:
On Learning Algorithms for Nash Equilibria. SAGT 2010: 114-125 - [c24]Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis:
How Good is the Chord Algorithm?. SODA 2010: 978-991
2000 – 2009
- 2009
- [j5]Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou:
The complexity of computing a Nash equilibrium. Commun. ACM 52(2): 89-97 (2009) - [j4]Constantinos Daskalakis:
Nash equilibria: Complexity, symmetries, and approximation. Comput. Sci. Rev. 3(2): 87-100 (2009) - [j3]Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou:
The Complexity of Computing a Nash Equilibrium. SIAM J. Comput. 39(1): 195-259 (2009) - [j2]Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou:
A note on approximate Nash equilibria. Theor. Comput. Sci. 410(17): 1581-1588 (2009) - [c23]Constantinos Daskalakis, Christos H. Papadimitriou:
On a Network Generalization of the Minmax Theorem. ICALP (2) 2009: 423-434 - [c22]Kamalika Chaudhuri, Constantinos Daskalakis, Robert D. Kleinberg, Henry Lin:
Online Bipartite Perfect Matching With Augmentations. INFOCOM 2009: 1044-1052 - [c21]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. RECOMB 2009: 451-465 - [c20]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and selection in posets. SODA 2009: 392-401 - [c19]Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant:
On the complexity of Nash equilibria of action-graph games. SODA 2009: 710-719 - [c18]Sanjeev Arora, Constantinos Daskalakis, David Steurer:
Message passing algorithms and improved LP decoding. STOC 2009: 3-12 - [c17]Constantinos Daskalakis, Christos H. Papadimitriou:
On oblivious PTAS's for nash equilibrium. STOC 2009: 75-84 - [c16]Ilan Adler, Constantinos Daskalakis, Christos H. Papadimitriou:
A Note on Strictly Competitive Games. WINE 2009: 471-474 - [i14]Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch:
Global Alignment of Molecular Sequences via Ancestral State Reconstruction. CoRR abs/0912.2577 (2009) - 2008
- [j1]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic Analysis of Linear Programming Decoding. IEEE Trans. Inf. Theory 54(8): 3565-3578 (2008) - [c15]Constantinos Daskalakis:
Computing Equilibria in Large Games We Play. CiE 2008: 154-157 - [c14]Constantinos Daskalakis, Christos H. Papadimitriou:
Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. FOCS 2008: 25-34 - [c13]Constantinos Daskalakis:
An Efficient PTAS for Two-Strategy Anonymous Games. WINE 2008: 186-197 - [i13]Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. CoRR abs/0801.4190 (2008) - [i12]Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant:
On the Complexity of Nash Equilibria of Action-Graph Games. CoRR abs/0802.1604 (2008) - [i11]Constantinos Daskalakis, Christos H. Papadimitriou:
Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. CoRR abs/0808.2801 (2008) - [i10]Constantinos Daskalakis:
An Efficient PTAS for Two-Strategy Anonymous Games. CoRR abs/0812.2277 (2008) - 2007
- [c12]Constantinos Daskalakis, Christos H. Papadimitriou:
Computing Equilibria in Anonymous Games. FOCS 2007: 83-93 - [c11]Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou:
Progress in approximate nash equilibria. EC 2007: 355-358 - [c10]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic analysis of linear programming decoding. SODA 2007: 385-394 - [c9]Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sébastien Roch:
First to market is not everything: an analysis of preferential attachment with fitness. STOC 2007: 135-144 - [i9]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. CoRR abs/0707.1532 (2007) - [i8]Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sebastien Roch:
First to Market is not Everything: an Analysis of Preferential Attachment with Fitness. CoRR abs/0710.4982 (2007) - [i7]Constantinos Daskalakis, Christos H. Papadimitriou:
Computing Equilibria in Anonymous Games. CoRR abs/0710.5582 (2007) - [i6]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic Analysis of Linear Programming Decoding. CoRR abs/cs/0702014 (2007) - [i5]Constantinos Daskalakis, Alexandros G. Dimakis, Elchanan Mossel:
Connectivity and Equilibrium in Random Games. CoRR abs/math/0703902 (2007) - 2006
- [c8]Constantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou:
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games. ICALP (1) 2006: 513-524 - [c7]Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao:
Maximal Accurate Forests from Distance Matrices. RECOMB 2006: 281-295 - [c6]Constantinos Daskalakis, Christos H. Papadimitriou:
Computing pure nash equilibria in graphical games via markov random fields. EC 2006: 91-99 - [c5]Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou:
The complexity of computing a Nash equilibrium. STOC 2006: 71-78 - [c4]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Optimal phylogenetic reconstruction. STOC 2006: 159-168 - [c3]Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou:
A Note on Approximate Nash Equilibria. WINE 2006: 297-306 - 2005
- [c2]Konstantinos Daskalakis, Christos H. Papadimitriou:
The Complexity of Games on Highly Regular Graphs. ESA 2005: 71-82 - [i4]Constantinos Daskalakis:
Computing Pure Nash Equilibria via Markov Random Fields. CoRR abs/cs/0510031 (2005) - [i3]Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch:
Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel's Conjecture. CoRR abs/math/0509575 (2005) - [i2]Konstantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou:
The complexity of computing a Nash equilibrium. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Konstantinos Daskalakis, Christos H. Papadimitriou:
Three-Player Games Are Hard. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c1]Stergios Stergiou, Konstantinos Daskalakis, George K. Papakonstantinou:
A fast and efficient heuristic ESOP minimization algorithm. ACM Great Lakes Symposium on VLSI 2004: 78-81
Coauthor Index
Alexandros G. Dimakis
aka: Alex Dimakis
aka: Alex Dimakis
Maxwell Fishelson
aka: Maxwell K. Fishelson
aka: Maxwell K. Fishelson
Sébastien Roch
aka: Sebastien Roch
aka: Sebastien Roch
Manolis Zampetakis
aka: Emmanouil Zampetakis
aka: Emmanouil Zampetakis
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-05 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
