Christos Tzamos
Cited by
Cited by
Strong Duality for a Multiple‐Good Monopolist
C Daskalakis, A Deckelbaum, C Tzamos
Econometrica 85 (3), 735-767, 2017
The complexity of optimal mechanism design
C Daskalakis, A Deckelbaum, C Tzamos
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
Mechanism design via optimal transport
C Daskalakis, A Deckelbaum, C Tzamos
Proceedings of the fourteenth ACM conference on Electronic commerce, 269-286, 2013
Ten steps of EM suffice for mixtures of two Gaussians
C Daskalakis, C Tzamos, M Zampetakis
Conference on Learning Theory, 704-710, 2017
On the power of deterministic mechanisms for facility location games
D Fotakis, C Tzamos
ACM Transactions on Economics and Computation (TEAC) 2 (4), 1-37, 2014
Winner-imposing strategyproof mechanisms for multiple facility location games
D Fotakis, C Tzamos
Theoretical Computer Science 472, 90-103, 2013
Strategyproof facility location for concave cost functions
D Fotakis, C Tzamos
Algorithmica 76 (1), 143-167, 2016
Distribution-independent PAC learning of halfspaces with massart noise
I Diakonikolas, T Gouleakis, C Tzamos
arXiv preprint arXiv:1906.10075, 2019
A size-free CLT for poisson multinomials and its applications
C Daskalakis, A De, G Kamath, C Tzamos
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Improving viterbi is hard: Better runtimes imply faster clique algorithms
A Backurs, C Tzamos
International Conference on Machine Learning, 311-321, 2017
Tight hardness results for maximum weight rectangles
A Backurs, N Dikkala, C Tzamos
arXiv preprint arXiv:1602.05837, 2016
A converse to Banach's fixed point theorem and its CLS-completeness
C Daskalakis, C Tzamos, M Zampetakis
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Does Information Revelation Improve Revenue?
C Daskalakis, C Papadimitriou, C Tzamos
Proceedings of the 2016 ACM Conference on Economics and Computation, 233-250, 2016
Learning halfspaces with massart noise under structured distributions
I Diakonikolas, V Kontonis, C Tzamos, N Zarifis
Conference on Learning Theory, 1486-1513, 2020
On the structure, covering, and learning of poisson multinomial distributions
C Daskalakis, G Kamath, C Tzamos
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1203-1217, 2015
Efficient statistics, in high dimensions, from truncated samples
C Daskalakis, T Gouleakis, C Tzamos, M Zampetakis
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
Optimal pricing is hard
C Daskalakis, A Deckelbaum, C Tzamos
International Workshop on Internet and Network Economics, 298-308, 2012
Fast modular subset sum using linear sketching
K Axiotis, A Backurs, C Jin, C Tzamos, H Wu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Capacitated dynamic programming: Faster knapsack and graph algorithms
K Axiotis, C Tzamos
arXiv preprint arXiv:1802.06440, 2018
Game theory based peer grading mechanisms for MOOCs
W Wu, C Daskalakis, N Kaashoek, C Tzamos, M Weinberg
Proceedings of the Second (2015) ACM Conference on Learning@ Scale, 281-286, 2015
The system can't perform the operation now. Try again later.
Articles 1–20