Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
- Proved the Nisan-Ronen conjecture
- Provided a new upper bound for the Universal TSP on the Grid, disproving an old conjecture due to Bertsimas and Grigni
- Initiated the study of Price of Anarchy in auction settings
- Solved one of the major open problems for linear congestion games and worked as a precursor to Roughgarden's smoothness framework
- Published papers in top conferences and journals such as STOC, FOCS, ICALP, etc.
Research Experience
- Held faculty positions at the University of Liverpool (UK) and University of Saarland (Germany)
- Postdoctoral research position at the Max-Planck Institute for Informatics (Germany)
- Long-term Visiting Scholar in the Economics and Computation program at the Simons Institute for the Theory of Computing at UC Berkeley in 2015
- Visiting Professor at the Athens University of Economics and Business in 2018
Education
No specific education background information.
Background
Associate Professor in the School of Informatics at Aristotle University of Thessaloniki and also a Collaborating Senior Researcher at the Archimedes Research Unit. Research interests include Algorithmic Game Theory, Mechanism Design, Online Algorithms, Approximation Algorithms, and Fair Division.