I am a Senior Lecturer (aka Associate Professor) in Algorithms and Complexity at the University of Glasgow, and a Turing Fellow. Previously I have held faculty positions at FAU Erlangen-Nürnberg and TU Munich, and have been a postdoctoral researcher at the Chairs of Algorithms & Complexity and Operations Research of TU Munich and the Economics and Computation group of the University of Liverpool.
I completed my DPhil (aka PhD) at the Computer Science department of the University of Oxford, advised by Elias Koutsoupias, where I was also a member of St Anne’s College. I hold an undergraduate degree in Mathematics and an MSc in Logic, Algorithms and Computation (MPLA), both from the University of Athens.
My interests lie in the general area of Algorithms, Complexity, and Optimization. I have primarily worked in the field of algorithmic game theory.
(For a more detailed list see also my dblp and ORCID profiles.)
Discrete Single-Parameter Optimal Auction Design [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos and Johannes Hahn
17th International Symposium on Algorithmic Game Theory (SAGT 2024)
On the Computation of Equilibria in Discrete First-Price Auctions [arXiv] [bibtex]
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender and Charalampos Kokkalis
To appear in 25th Conference on Economics and Computation (EC 2024)
A Smoothed FPTAS for Equilibria in Congestion Games [arXiv] [bibtex]
Yiannis Giannakopoulos
To appear in 25th Conference on Economics and Computation (EC 2024)
On the Smoothed Complexity of Combinatorial Local Search [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos, Alexander Grosz and Themistoklis Melissourgos
51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
On the Complexity of Equilibrium Computation in First-Price Auctions [pdf] [arXiv] [doi] [bibtex]
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos and Diogo Poças
SIAM Journal on Computing (SICOMP), 52 (1): 80–131, 2023.
A preliminary version appeared in:
22nd ACM Conference on Economics and Computation (EC 2021) [doi] [bibtex]
Robust Revenue Maximization Under Minimal Statistical Information [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos, Diogo Poças and Alexandros Tsigonias-Dimitriadis
ACM Transactions on Economics and Computation (TEAC), 10 (3): 11:1–11:34, 2022.
An extended abstract appeared in:
16th Conference on Web and Internet Economics (WINE 2020) [doi] [bibtex]
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos, Georgy Noarov and Andreas S. Schulz
Mathematics of Operations Research (MOR), 47 (1): 643–664, 2022.
An abstract appeared in:
13th Symposium on Algorithmic Game Theory (SAGT 2020) [doi] [bibtex]
A New Lower Bound for Deterministic Truthful Scheduling [arXiv] [epdf] [doi] [bibtex]
Yiannis Giannakopoulos, Alexander Hammerl and Diogo Poças
Algorithmica, 83 (9): 2895–2913, 2021.
A preliminary version appeared in:
13th Symposium on Algorithmic Game Theory (SAGT 2020) [doi] [bibtex]
A Unifying Approximate Potential for Weighted Congestion Games [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos and Diogo Poças
Theory of Computing Systems (TOCS), 67: 855–876, 2023.
A preliminary version appeared in:
13th Symposium on Algorithmic Game Theory (SAGT 2020) [doi] [bibtex]
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games [arXiv] [doi] [bibtex]
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças and Clara Waldmann
Mathematics of Operations Research (MOR), 48 (1): 583–602, 2023.
An extended abstract appeared in:
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) [doi] [bibtex]
The Pareto Frontier of Inefficiency in Mechanism Design [arXiv] [doi] [bibtex]
Aris Filos-Ratsikas, Yiannis Giannakopoulos and Philip Lazos
Mathematics of Operations Research (MOR), 47 (2): 923–944, 2022.
An extended abstract appeared in:
15th Conference on Web and Internet Economics (WINE 2019) [doi] [bibtex]
Optimal Pricing For MHR and $\lambda$-Regular Distributions [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos, Diogo Poças and Keyu Zhu
ACM Transactions on Economics and Computation (TEAC), 9 (1): 2:1–2:28, 2020. (Invited)
An earlier version, not including the results for $\lambda$-regular distributions, appeared in:
14th Conference on Web and Internet Economics (WINE 2018) [doi] [bibtex]
The Price of Stability of Weighted Congestion Games [pdf] [arXiv] [doi] [bibtex]
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos and Paul Spirakis
SIAM Journal on Computing (SICOMP), 48 (5): 1544–1582, 2019.
A preliminary version appeared in:
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) [doi] [bibtex]
Online Market Intermediation [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos, Elias Koutsoupias and Philip Lazos
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
The Anarchy of Scheduling Without Money [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos, Elias Koutsoupias and Maria Kyropoulou
Theoretical Computer Science (TCS), 778: 19–32, 2019.
A preliminary version (not including all results) appeared in:
9th International Symposium on Algorithmic Game Theory (SAGT 2016) [doi] [bibtex]
The VCG Mechanism for Bayesian Scheduling [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos and Maria Kyropoulou
ACM Transactions on Economics and Computation (TEAC), 5 (4): 19:1–19:16, 2017. (Invited)
A preliminary version appeared in:
11th Conference on Web and Internet Economics (WINE 2015) [doi] [bibtex]
Duality Theory for Optimal Mechanism Design [pdf] [bibtex]
Yiannis Giannakopoulos
DPhil Thesis, University of Oxford. July 2015.
Selling Two Goods Optimally [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos and Elias Koutsoupias
Information and Computation (Inf. Comput.), 261: 432–445, 2018. (Invited)
A preliminary version appeared in:
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) [doi] [bibtex]
(Best Paper Award)
Bounding the Optimal Revenue of Selling Multiple Goods [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos
Theoretical Computer Science (TCS), 581: 83–96, 2015.
Competitive Analysis of Maintaining Frequent Items of a Stream [pdf] [doi] [bibtex]
Yiannis Giannakopoulos and Elias Koutsoupias
Theoretical Computer Science (TCS), 562: 23–32, 2015.
(A preliminary version, not including all results, appeared in SWAT 2012. [doi])
Duality and Optimality of Auctions for Uniform Distributions [pdf] [arXiv] [doi] [bibtex]
Yiannis Giannakopoulos and Elias Koutsoupias
SIAM Journal on Computing (SICOMP), 47 (1): 121–165, 2018.
A preliminary version appeared in:
15th ACM Conference on Economics and Computation (EC 2014) [doi] [bibtex]
A Note on Selling Optimally Two Uniformly Distributed Goods [arXiv] [bibtex]
Yiannis Giannakopoulos
CoRR: abs/1409.6925, 2014.
Streaming Techniques and Data Aggregation in Networks of Tiny Artefacts [pdf preprint] [doi] [bibtex]
Luca Becchetti, Ioannis Chatzigiannakis and Yiannis Giannakopoulos
Computer Science Review, 5 (1): 27–46, February 2011.
Mechanism Design and Strong Truthfulness [doi] [bibtex]
Yiannis Giannakopoulos
Chapter 8 in Applications of Secure Multiparty Computation, P. Laud and L. Kamm, Eds., IOS Press, 2015.
Data Aggregation [pdf] [bibtex] [ebook]
Yiannis Giannakopoulos and Christos Koninis
Chapter 5 in Distributed Self-organized Societies of Tiny Artefacts: Design & Implementation, I. Chatzigiannakis and P. Spirakis, Eds., Lulu Publishers, 2011.
My M.Sc. thesis on Online Mechanism Design [pdf] [presentation] [bibtex]
Supervisor: Prof. Elias Koutsoupias
I am happy to be supervising the following PhD students:
and also having worked closely with the following ones (although not in any official supervising capacity):
(first name)(dot)(last name)@glasgow.ac.uk
Office M101, Sir Alwyn Williams Building, 18 Lilybank Gardens, Glasgow G12 8RZ, UK
send email for appointment