Ioannis is a professor at the Department of Computer Science of Aarhus University (since August 2020), where he also serves as the Head of the research group on Computational Complexity and Game Theory. Prior to his current appointment, he was a faculty member at the Department of Computer Engineering and Informatics at the University of Patras (2006-2020).
His research interests include design and analysis of algorithms (including approximation and online algorithms), economics and computation (computational aspects of fair division, voting, matching problems, auctions, and congestion games), and foundations of machine learning and artificial intelligence (including strategic aspects of learning tasks and data processing).
Selected publications
- Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, & Junxing Wang. The Unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation, 7(3): 12:1-12:32, 2019.
- Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, & Éva Tardos. Bounding the inefficiency of outcomes in generalized second price auctions. Journal of Economic Theory, 156: 343-388, 2015.
- Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel D. Procaccia, & Or Sheffet. Optimal social choice functions: A utilitarian view. Artificial Intelligence, 227: 190-213, 2015.