Christos Tzamos

Email:
@wisc.edu
tzamos mymail
Phone:
909-1739
(617)- myphone
Google Scholar | DBLP | arXiv | Github

About

I am a post-doctoral researcher at Microsoft Research New England working on Mechanism Design, Algorithms and Machine Learning.

On August 2018, I will join the Theory of Computing group at UW Madison as an Assistant Professor of Computer Science.

I completed my PhD in the Theory of Computation group at MIT under the supervision of Costis Daskalakis. I grew up in Athens, Greece where I also had my undergraduate studies at the National Technical University of Athens.

Research

I am interested in Algorithmic Game Theory, Learning Theory as well as in the Design, Analysis and Theory of Algorithms.

Journal Articles

  1. “Design and Dynamic Pricing of Vertically Differentiated Inventories”
    with I. Stamatopoulos

    Management Science (2018) - to appear
  2. “Strong Duality for a Multiple-Good Monopolist”
    with C. Daskalakis, and A. Deckelbaum

    Econometrica 85(3): 735-767 (2017)
  3. “Efficient Money Burning in General Domains”
    with D. Fotakis, D. Tsipras, and M. Zampetakis

    Theory of Computing Systems. Special Issue for SAGT 2015. Invited.
  4. “Strategyproof Facility Location for Concave Cost Functions”
    with D. Fotakis

    Algorithmica 76(1): 143-167 (2016)
  5. “On the Power of Deterministic Mechanisms for Facility Location Games”
    with D. Fotakis

    ACM Transactions on Economics and Computation 2(4): 15:1-15:37 (2014)
  6. “Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games”
    with D. Fotakis

    Theoretical Computer Science 472: 90-103 (2013)

Conference Proceedings

  1. “Actively Avoiding Nonsense in Generative Models”
    with S. Hanneke, A. Kalai, and G. Kamath

    in the 31st Annual Conference on Learning Theory, COLT 2018
  2. “Learning from Unreliable Datasets”
    with T. Gouleakis, and M. Zampetakis

    in the 31st Annual Conference on Learning Theory, COLT 2018
  3. “A Converse to Banach’s Fixed Point Theorem and its CLS Completeness”
    with C. Daskalakis, and M. Zampetakis

    in the 50th Annual ACM Symposium on Theory of Computing, STOC 2018
  4. “Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model”
    with C. Daskalakis, and M. Zampetakis

    in the 21st International Conference on Artificial Intelligence and Statistics, AISTATS 2018
  5. “Ten Steps of EM Suffice for Mixtures of Two Gaussians”
    with C. Daskalakis, and M. Zampetakis

    in the 30th Annual Conference on Learning Theory, COLT 2017
    - Preliminary version in NIPS 2016 Workshop on Non-Convex Optimization for Machine Learning.
  6. “Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms”
    with A. Backurs

    in the 34th International Conference on Machine Learning, ICML 2017
  7. “Faster Sublinear Algorithms via Conditional Sampling”
    with T. Gouleakis, and M. Zampetakis

    in the 28th ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
  8. “Does Information Revelation Improve Revenue?”
    with C. Daskalakis, and C. Papadimitriou

    in the 17th ACM Conference on Economics and Computation, EC 2016
  9. “Mechanism Design with Selective Verification”
    with D. Fotakis, and M. Zampetakis

    in the 17th ACM Conference on Economics and Computation, EC 2016
  10. “Tight Hardness Results for Maximum Weight Rectangles”
    with A. Backurs, and N. Dikkala

    in the 43rd Int'l Colloquium on Automata, Languages and Programming, ICALP 2016
  11. “Anonymous Auctions Maximizing Revenue”
    with C. Wilkens

    in the 12th Workshop on Internet & Network Economics, WINE 2016
  12. “A Size-Free CLT for Poisson Multinomials and its Applications”
    with C. Daskalakis, A. De, and G. Kamath

    in the 48th Annual ACM Symposium on Theory of Computing, STOC 2016
  13. “On the Structure, Covering and Learning of Poisson Multinomial Distributions”
    with C. Daskalakis, and G. Kamath

    in the 56th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2015
  14. “Strong Duality for a Multiple-Good Monopolist”
    with C. Daskalakis, and A. Deckelbaum

    in the 16th ACM Conference on Economics and Computation, EC 2015
  15. “Efficient Money Burning in General Domains”
    with D. Fotakis, D. Tsipras, and M. Zampetakis

    in the 8th International Symposium on Algorithmic Game Theory, SAGT 2015
  16. “The Complexity of Optimal Mechanism Design”
    with C. Daskalakis, and A. Deckelbaum

    in the 25th ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
  17. “Mechanism Design via Optimal Transport”
    with C. Daskalakis, and A. Deckelbaum

    in the 14th ACM Conference on Economics and Computation, EC 2013
    ★ Best Paper and Best Student Paper Award
  18. “Strategyproof Facility Location for Concave Cost Functions”
    with D. Fotakis

    in the 14th ACM Conference on Economics and Computation, EC 2013
  19. “On the Power of Deterministic Mechanisms for Facility Location Games”
    with D. Fotakis

    in the 40th Int'l Colloquium on Automata, Languages and Programming, ICALP 2013
  20. “Optimal Pricing is Hard”
    with C. Daskalakis, and A. Deckelbaum

    in the 8th Workshop on Internet & Network Economics, WINE 2012
  21. “Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games”
    with D. Fotakis

    in the 6th Workshop on Internet & Network Economics, WINE 2010

Working Papers

  1. “Combinatorial Assortment Optimization”
    with N. Immorlica, B. Lucier, J. Mao, and V. Syrgkanis

  2. “Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms”
    with K. Axiotis

Awards and Honors

Miscellaneous