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
-
“Strong Duality for a Multiple-Good Monopolist”
Econometrica 85(3): 735-767 (2017)
-
“Efficient Money Burning in General Domains”
Theory of Computing Systems. Special Issue for SAGT 2015. Invited.
-
“Strategyproof Facility Location for Concave Cost Functions”
Algorithmica 76(1): 143-167 (2016)
-
“On the Power of Deterministic Mechanisms for Facility Location Games”
ACM Transactions on Economics and Computation 2(4): 15:1-15:37 (2014)
-
“Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games”
Theoretical Computer Science 472: 90-103 (2013)
Conference Proceedings
-
“A Converse to Banach’s Fixed Point Theorem and its CLS Completeness”
in the 50th Annual ACM Symposium on Theory of Computing, STOC 2018
-
“Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model”
in the 21st International Conference on Artificial Intelligence and Statistics, AISTATS 2018
-
“Ten Steps of EM Suffice for Mixtures of Two Gaussians”
in the 30th Annual Conference on Learning Theory, COLT 2017
- Preliminary version in NIPS 2016 Workshop on Non-Convex Optimization for Machine Learning.
-
“Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms”
in the 34th International Conference on Machine Learning, ICML 2017
-
“Faster Sublinear Algorithms via Conditional Sampling”
in the 28th ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
-
“Does Information Revelation Improve Revenue?”
in the 17th ACM Conference on Economics and Computation, EC 2016
-
“Mechanism Design with Selective Verification”
in the 17th ACM Conference on Economics and Computation, EC 2016
-
“Tight Hardness Results for Maximum Weight Rectangles”
in the 43rd Int'l Colloquium on Automata, Languages and Programming, ICALP 2016
-
“Anonymous Auctions Maximizing Revenue”
in the 12th Workshop on Internet & Network Economics, WINE 2016
-
“A Size-Free CLT for Poisson Multinomials and its Applications”
in the 48th Annual ACM Symposium on Theory of Computing, STOC 2016
-
“On the Structure, Covering and Learning of Poisson Multinomial Distributions”
in the 56th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2015
-
“Strong Duality for a Multiple-Good Monopolist”
in the 16th ACM Conference on Economics and Computation, EC 2015
-
“Efficient Money Burning in General Domains”
in the 8th International Symposium on Algorithmic Game Theory, SAGT 2015
-
“The Complexity of Optimal Mechanism Design”
in the 25th ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
-
“Mechanism Design via Optimal Transport”
in the 14th ACM Conference on Economics and Computation, EC 2013
★ Best Paper and Best Student Paper Award
-
“Strategyproof Facility Location for Concave Cost Functions”
in the 14th ACM Conference on Economics and Computation, EC 2013
-
“On the Power of Deterministic Mechanisms for Facility Location Games”
in the 40th Int'l Colloquium on Automata, Languages and Programming, ICALP 2013
-
“Optimal Pricing is Hard”
in the 8th Workshop on Internet & Network Economics, WINE 2012
-
“Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games”
in the 6th Workshop on Internet & Network Economics, WINE 2010
Working Papers
-
“Combinatorial Assortment Optimization”
-
“Actively Avoiding Nonsense in Generative Models”
-
“Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms”
-
“Optimal Seat Pricing With Multiple Classes & Why Economy Seats Feel so Small”
Awards and Honors
Miscellaneous