4 citations · 10 across the 8 of their papers we have counts for
16 papers
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm +1
Characterizing the performance of no-regret dynamics in multi-player games is a foundational problem at the interface of online learning and game theory. Recent results have reveal…
Learning and Covering Sums of Independent Random Variables with Unbounded Support
Alkis Kalavasis, Konstantinos Stavropoulos, Manolis Zampetakis
We study the problem of covering and learning sums of independent integer-valued random variables (SIIRVs) with unbounded, or even infinite, support.…
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games
Constantinos Daskalakis, Noah Golowich, Stratis Skoulakis +1
Min-max optimization problems involving nonconvex-nonconcave objectives have found important applications in adversarial training and other multi-agent learning settings. Yet, no k…
Estimation of Standard Auction Models
Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas +1
We provide efficient estimation methods for first- and second-price auctions under independent (asymmetric) private values and partial observability. Given a finite set of observat…
Robust Learning of Optimal Auctions
Wenshuo Guo, Michael I. Jordan, Manolis Zampetakis
We study the problem of learning revenue-optimal multi-bidder auctions from samples when the samples of bidders' valuations can be adversarially corrupted or drawn from distributio…
Computationally and Statistically Efficient Truncated Regression
Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos +1
We provide a computationally and statistically efficient estimator for the classical problem of truncated linear regression, where the dependent variable and its co…