Dr Yiannis Giannakopoulos

  • Senior Lecturer in Algorithms and Complexity (School of Computing Science)

telephone: 01413306056
email: Yiannis.Giannakopoulos@glasgow.ac.uk
pronouns: He/him/his

Room M101, Sir Alwyn Williams Building, 18 Lilybank Gardens, School of Computing Science, University of Glasgow, Glasgow, G12 8RZ

Import to contacts

ORCID iDhttps://orcid.org/0000-0003-2382-1779

Biography

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 Chair of Algorithms & Complexity 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.

Research interests

My interests lie in the general area of Algorithms, Complexity and Optimization. I have primarily worked in the field of algorithmic game theory.

Research groups

  • Formal Analysis, Theory & Algorithms

Publications

List by: Type | Date

Jump to: 2025 | 2024 | 2023 | 2022 | 2021 | 2020 | 2019
Number of items: 19.

2025

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Grosz, Alexander and Melissourgos, Themistoklis (2025) On the smoothed complexity of combinatorial local search. Mathematics of Operations Research, (doi: 10.1287/moor.2024.0610) (Early Online Publication)

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros and Kokkalis, Charalampos (2025) Equilibrium Computation in First-Price Auctions with Correlated Priors. In: Twenty-Sixth ACM Conference on Economics and Computation (EC'25), Stanford, CA, USA, 7-10 Jul 2025, pp. 7-33. ISBN 9798400719431 (doi: 10.1145/3736252.3742487)

2024

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros and Kokkalis, Charalampos (2024) On the Computation of Equilibria in Discrete First-Price Auctions. In: Twenty-Fifth ACM Conference on Economics and Computation (EC'24), New Haven, CT, USA, 8-11 July 2024, pp. 379-399. ISBN 9798400707049 (doi: 10.1145/3670865.3673509)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 (2024) A Smoothed FPTAS for Equilibria in Congestion Games. In: Twenty-Fifth ACM Conference on Economics and Computation (EC'24), New Haven, CT, USA, 8-11 July 2024, pp. 401-413. ISBN 9798400707049 (doi: 10.1145/3670865.3673615)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Hahn, Johannes (2024) Discrete Single-Parameter Optimal Auction Design. In: 17th International Symposium on Algorithmic Game Theory (SAGT), Amsterdam, The Netherlands, 03-06 Sep 2024, pp. 165-183. ISBN 9783031710322 (doi: 10.1007/978-3-031-71033-9_10)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Grosz, Alexander and Melissourgos, Themistoklis (2024) On the Smoothed Complexity of Combinatorial Local Search. In: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Tallinn, Estonia, 8-12 July 2024, 72:1-72:19. ISBN 9783959773225 (doi: 10.4230/LIPIcs.ICALP.2024.72)

2023

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros, Lazos, Philip and Poças, Diogo (2023) On the complexity of equilibrium computation in first-price auctions. SIAM Journal on Computing, 52(1), pp. 80-131. (doi: 10.1137/21M1435823)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Tsigonias-Dimitriadis, Alexandros (2023) Robust revenue maximization under minimal statistical information. ACM Transactions on Economics and Computation, 10(3), 11. (doi: 10.1145/3546606)

Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Waldmann, Clara (2023) Existence and complexity of approximate equilibria in weighted congestion games. Mathematics of Operations Research, 48(1), pp. 583-602. (doi: 10.1287/moor.2022.1272)

2022

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Lazos, Philip (2022) The pareto frontier of inefficiency in mechanism design. Mathematics of Operations Research, 47(2), pp. 923-944. (doi: 10.1287/moor.2021.1154 Abstract)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Noarov, Georgy and Schulz, Andreas S. (2022) Computing approximate equilibria in weighted congestion games via best-responses. Mathematics of Operations Research, 47(1), pp. 643-664. (doi: 10.1287/moor.2021.1144)

2021

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros, Lazos, Philip and Poças, Diogo (2021) On the Complexity of Equilibrium Computation in First-Price Auctions. In: 22nd ACM Conference on Economics and Computation (EC), 18-23 Jul 2021, pp. 454-476. ISBN 9781450385541 (doi: 10.1145/3465456.3467627)

2020

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Tsigonias-Dimitriadis, Alexandros (2020) Robust Revenue Maximization Under Minimal Statistical Information. In: 16th Conference on Web and Internet Economics (WINE), Beijing, China, 07-11 Dec 2020, pp. 177-190. ISBN 9783030649463 (doi: 10.1007/978-3-030-64946-3_13)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hammerl, Alexander and Poças, Diogo (2020) A New Lower Bound for Deterministic Truthful Scheduling. In: 13th Symposium on Algorithmic Game Theory (SAGT), Augsburg, Germany, 16-18 Sep 2020, pp. 226-240. ISBN 9783030579807 (doi: 10.1007/978-3-030-57980-7_15)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Noarov, Georgy and Schulz, Andreas S. (2020) Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses. 13th Symposium on Algorithmic Game Theory (SAGT), Augsburg, Germany, 16-18 Sep 2020. p. 339. ISBN 9783030579807

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Poças, Diogo (2020) A Unifying Approximate Potential for Weighted Congestion Games. In: 13th Symposium on Algorithmic Game Theory (SAGT), Augsburg, Germany, 16-18 Sep 2020, pp. 99-113. ISBN 9783030579807 (doi: 10.1007/978-3-030-57980-7_7)

Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Waldmann, Clara (2020) Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP), Saarbrücken, Germany, 08-11 Jul 2020, 32:1-32:18. ISBN 9783959771382 (doi: 10.4230/LIPIcs.ICALP.2020.32)

2019

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Koutsoupias, Elias and Kyropoulou, Maria (2019) The anarchy of scheduling without money. Theoretical Computer Science, 778, 19 - 32. (doi: 10.1016/j.tcs.2019.01.022)

Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Spirakis, Paul G. (2019) The price of stability of weighted congestion games. SIAM Journal on Computing, 48(5), pp. 1544-1582. (doi: 10.1137/18M1207880)

This list was generated on Wed Oct 15 20:49:51 2025 BST.
Jump to: Articles | Conference or Workshop Item | Conference Proceedings
Number of items: 19.

Articles

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Grosz, Alexander and Melissourgos, Themistoklis (2025) On the smoothed complexity of combinatorial local search. Mathematics of Operations Research, (doi: 10.1287/moor.2024.0610) (Early Online Publication)

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros, Lazos, Philip and Poças, Diogo (2023) On the complexity of equilibrium computation in first-price auctions. SIAM Journal on Computing, 52(1), pp. 80-131. (doi: 10.1137/21M1435823)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Tsigonias-Dimitriadis, Alexandros (2023) Robust revenue maximization under minimal statistical information. ACM Transactions on Economics and Computation, 10(3), 11. (doi: 10.1145/3546606)

Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Waldmann, Clara (2023) Existence and complexity of approximate equilibria in weighted congestion games. Mathematics of Operations Research, 48(1), pp. 583-602. (doi: 10.1287/moor.2022.1272)

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Lazos, Philip (2022) The pareto frontier of inefficiency in mechanism design. Mathematics of Operations Research, 47(2), pp. 923-944. (doi: 10.1287/moor.2021.1154 Abstract)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Noarov, Georgy and Schulz, Andreas S. (2022) Computing approximate equilibria in weighted congestion games via best-responses. Mathematics of Operations Research, 47(1), pp. 643-664. (doi: 10.1287/moor.2021.1144)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Koutsoupias, Elias and Kyropoulou, Maria (2019) The anarchy of scheduling without money. Theoretical Computer Science, 778, 19 - 32. (doi: 10.1016/j.tcs.2019.01.022)

Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Spirakis, Paul G. (2019) The price of stability of weighted congestion games. SIAM Journal on Computing, 48(5), pp. 1544-1582. (doi: 10.1137/18M1207880)

Conference or Workshop Item

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Noarov, Georgy and Schulz, Andreas S. (2020) Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses. 13th Symposium on Algorithmic Game Theory (SAGT), Augsburg, Germany, 16-18 Sep 2020. p. 339. ISBN 9783030579807

Conference Proceedings

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros and Kokkalis, Charalampos (2025) Equilibrium Computation in First-Price Auctions with Correlated Priors. In: Twenty-Sixth ACM Conference on Economics and Computation (EC'25), Stanford, CA, USA, 7-10 Jul 2025, pp. 7-33. ISBN 9798400719431 (doi: 10.1145/3736252.3742487)

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros and Kokkalis, Charalampos (2024) On the Computation of Equilibria in Discrete First-Price Auctions. In: Twenty-Fifth ACM Conference on Economics and Computation (EC'24), New Haven, CT, USA, 8-11 July 2024, pp. 379-399. ISBN 9798400707049 (doi: 10.1145/3670865.3673509)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 (2024) A Smoothed FPTAS for Equilibria in Congestion Games. In: Twenty-Fifth ACM Conference on Economics and Computation (EC'24), New Haven, CT, USA, 8-11 July 2024, pp. 401-413. ISBN 9798400707049 (doi: 10.1145/3670865.3673615)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Hahn, Johannes (2024) Discrete Single-Parameter Optimal Auction Design. In: 17th International Symposium on Algorithmic Game Theory (SAGT), Amsterdam, The Netherlands, 03-06 Sep 2024, pp. 165-183. ISBN 9783031710322 (doi: 10.1007/978-3-031-71033-9_10)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Grosz, Alexander and Melissourgos, Themistoklis (2024) On the Smoothed Complexity of Combinatorial Local Search. In: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Tallinn, Estonia, 8-12 July 2024, 72:1-72:19. ISBN 9783959773225 (doi: 10.4230/LIPIcs.ICALP.2024.72)

Filos-Ratsikas, Aris, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hollender, Alexandros, Lazos, Philip and Poças, Diogo (2021) On the Complexity of Equilibrium Computation in First-Price Auctions. In: 22nd ACM Conference on Economics and Computation (EC), 18-23 Jul 2021, pp. 454-476. ISBN 9781450385541 (doi: 10.1145/3465456.3467627)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Tsigonias-Dimitriadis, Alexandros (2020) Robust Revenue Maximization Under Minimal Statistical Information. In: 16th Conference on Web and Internet Economics (WINE), Beijing, China, 07-11 Dec 2020, pp. 177-190. ISBN 9783030649463 (doi: 10.1007/978-3-030-64946-3_13)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Hammerl, Alexander and Poças, Diogo (2020) A New Lower Bound for Deterministic Truthful Scheduling. In: 13th Symposium on Algorithmic Game Theory (SAGT), Augsburg, Germany, 16-18 Sep 2020, pp. 226-240. ISBN 9783030579807 (doi: 10.1007/978-3-030-57980-7_15)

Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779 and Poças, Diogo (2020) A Unifying Approximate Potential for Weighted Congestion Games. In: 13th Symposium on Algorithmic Game Theory (SAGT), Augsburg, Germany, 16-18 Sep 2020, pp. 99-113. ISBN 9783030579807 (doi: 10.1007/978-3-030-57980-7_7)

Christodoulou, George, Gairing, Martin, Giannakopoulos, Yiannis ORCID logoORCID: https://orcid.org/0000-0003-2382-1779, Poças, Diogo and Waldmann, Clara (2020) Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP), Saarbrücken, Germany, 08-11 Jul 2020, 32:1-32:18. ISBN 9783959771382 (doi: 10.4230/LIPIcs.ICALP.2020.32)

This list was generated on Wed Oct 15 20:49:51 2025 BST.

Supervision

Teaching

Current teaching:

Recent teaching:

Additional information

For more details please see my personal website.


Yiannis Giannakopoulos