Constantinos Daskalakis

Constantinos Daskalakis

Auto-generated profile, based on publicly available information

Constantinos Daskalakis

Massachusetts Institute of Technology, Cambridge, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

15 June 2025
Verified
Conference Paper
Open access
CDConstantinos Daskalakis
Constantinos Daskalakis
GFGabriele Farina
Gabriele Farina
MFMaxwell Fishelson
Maxwell Fishelson
CPCharilaos Pipis
Charilaos Pipis
JSJon Schneider
Jon Schneider

15 June 2025
Verified
Conference Paper
Open access
YDYuval Dagan
Yuval Dagan
CDConstantinos Daskalakis
Constantinos Daskalakis
MFMaxwell Fishelson
Maxwell Fishelson
NGNoah Golowich
Noah Golowich
RKRobert Kleinberg
Robert Kleinberg
POPrincewill Okoroafor
Princewill Okoroafor


4 May 2022 in arXiv
Verified
Preprint
Open access
PDF file
YCYeshwanth Cherapanamjeri
Yeshwanth Cherapanamjeri
CDConstantinos Daskalakis
Constantinos Daskalakis
AIAndrew Ilyas
Andrew Ilyas
MZManolis Zampetakis
Manolis Zampetakis
We provide efficient estimation methods for first- and second-price auctions under independent (asymmetric) private values and partial observability. Given a finite set of observations, each comprising the identity of the winner and the price they paid in a sequence of identical auctions, we provide algorithms for non-parametrically estimating the bid distribution of each bidder, as well as their value distributions under equilibrium assumptions. We provide finite-sample estimation bounds which are uniform in that their error rates do not depend on the bid/value distributions being estimated. Our estimation guarantees advance a body of work in Econometrics wherein only identification results have been obtained, unless the setting is symmetric, parametric, or all bids are observable. Our guarantees also provide computationally and statistically effective alternatives to classical techniques from reliability theory. Finally, our results are immediately applicable to Dutch and English auctions.

23 November 2022 in arXiv
Verified
Preprint
Open access
PDF file
YDYuval Dagan
Yuval Dagan
CDConstantinos Daskalakis
Constantinos Daskalakis
AKAnthimos Vardis Kandiros
Anthimos Vardis Kandiros
We study the optimization landscape of the log-likelihood function and the convergence of the Expectation-Maximization (EM) algorithm in latent Gaussian tree models, i.e. tree-structured Gaussian graphical models whose leaf nodes are observable and non-leaf nodes are unobservable. We show that the unique non-trivial stationary point of the population log-likelihood is its global maximum, and establish that the expectation-maximization algorithm is guaranteed to converge to it in the single latent variable case. Our results for the landscape of the log-likelihood function in general latent tree models provide support for the extensive practical use of maximum likelihood based-methods in this setting. Our results for the EM algorithm extend an emerging line of work on obtaining global convergence guarantees for this celebrated algorithm. We show our results for the non-trivial stationary points of the log-likelihood by arguing that a certain system of polynomial equations obtained from the EM updates has a unique non-trivial solution. The global convergence of the EM algorithm follows by arguing that all trivial fixed points are higher-order saddle points.