Vasilis Gkatzelis

I am an assistant professor of computer science at the College of Computing & Informatics of Drexel University Previous Appointments: Spring 2016: postdoc at UC Berkeley hosted by Christos Papadimitriou and Eric Friedman Fall 2015: research fellow at the Simons Institute for the Theory of Computing at UC Berkeley 2013-2015: postdoc at Stanford University hosted by Tim Roughgarden Education: PhD (2013): Courant Institute of New York University (advised dy Richard Cole) Diploma (2007): Computer Engineering and Informatics of University of Patras During my PhD I also had the opportunity to work as an intern for: Microsoft Research in Mountain View, CA HP Labs in Palo Alto, CA Google in New York, NY

Recent Publications

• Fair and Efficient Online Allocations with Normalized Valuations (with A. Psomas and X. Tan) at AAAI 2021
• Achieving Proportionality up to the Maximin Item with Indivisible Goods (with A. Baklanov, P. Garimidi, and D. Schoepflin) at AAAI 2021
• Resolving the Optimal Metric Distortion Conjecture (with D. Halpern and N. Shah) at FOCS 2020
• Resource-Aware Protocols for Network Cost-Sharing Games (with G. Christodoulou, A. Sgouritsa, and M. Latifian) at EC 2020
• A Truthful Cardinal Mechanism for One-Sided Matching (with R. Abebe, R. Cole, and J. Hartline) at SODA 2020
• Balanced Ranking with Diversity Constraints (with K. Yang and J. Stoyanovich) at IJCAI 2019
• Fair and Efficient Memory Sharing: Confronting Free Riders (with E.J. Friedman, C.A. Psomas, and S. Shenker) at AAAI 2019
• Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling (with I. Caragiannis and C. Vinci) at WINE 2017
• Deferred-Acceptance Auctions for Multiple Levels of Service (with E. Markakis and T. Roughgarden) at EC 2017
• Cost-Sharing Methods for Scheduling Games under Uncertainty (with G. Christodoulou and A. Sgouritsa) at EC 2017
• Convex Program Duality, Fisher Markets, and Nash Social Welfare (with R. Cole et al.) at EC 2017
• Nash Social Welfare Approximation for Strategic Agents (with S. Branzei and R. Mehta) at EC 2017
• Participation Incentives on a Wireless Random Access Erasure Collision Channel (with S. Weber) at NetEcon 2017

Program Committees

• ACM-SIAM Symposium on Discrete Algorithms (SODA: 2022)
• ACM Conference on Economics & Computation (EC: 2021, 2020, 2019, 2018, 2017, 2016, 2015)
• Conference on Web and Internet Economics (WINE: 2020, 2019, 2018, 2017, 2016, 2015, 2014)
• Conference on Artificial Intelligence (AAAI: 2021, 2020, 2018, 2017)
• International Joint Conference on Artificial Intelligence (IJCAI: 2021, 2020, 2018, 2017, 2016)
• International World Wide Web Conference (WWW: 2019, 2018, 2017)
• International Symposium on Algorithmic Game Theory (SAGT: 2018)
• International Conference on Autonomous Agents & Multiagent Systems (AAMAS: 2017)
• AAAI/ACM Conference on Artificial Intelligence, Ethics, and Society (AEIS: 2019)
• Workshop on the Economics of Networks, Systems and Computation (NetEcon: 2019)

Teaching

• Drexel Computer Science Theory reading group
• CS621 "Approximation Algorithms" (Spring 2020)
• CS618 "Algorithmic Game Theory" (Spring 2019)
• CS457 "Data Structures and Algorithms I" (Fall 2016-2019)
• CS525 "Theory of Computation" (Spring 2018)
• CST680 "Economics and Computation" (Spring 2017)

PhD Students

• Daniel Schoepflin
• Xizhi Tan
• Jeromy Guinther

NSF Funding (CCF-AF)

• CAREER: "Optimal Mechanism Design without Monetary Transfers" ($600,000, Duration: 2/2021-1/2026)
• SMALL: "The Efficiency of Clock Auctions" ($358,000, Duration: 7/2020-7/2023)
• CRII: "Practical Auction Design Using the Deferred-Acceptance Framework" ($183,000, Duration: 2/2018-1/2020)

Contact