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
https://orcid.org/0000-0003-2382-1779Biography
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.
Publications
2024
Filos-Ratsikas, A., Giannakopoulos, Y. , Hollender, A. and Kokkalis, C. (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, Y. (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, Y. and Hahn, J. (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, Y. , Grosz, A. and Melissourgos, T. (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, A., Giannakopoulos, Y. , Hollender, A., Lazos, P. and Poças, D. (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, Y. , Poças, D. and Tsigonias-Dimitriadis, A. (2023) Robust revenue maximization under minimal statistical information. ACM Transactions on Economics and Computation, 10(3), 11. (doi: 10.1145/3546606)
Christodoulou, G., Gairing, M., Giannakopoulos, Y. , Poças, D. and Waldmann, C. (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, A., Giannakopoulos, Y. and Lazos, P. (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, Y. , Noarov, G. and Schulz, A. 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, A., Giannakopoulos, Y. , Hollender, A., Lazos, P. and Poças, D. (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, Y. , Poças, D. and Tsigonias-Dimitriadis, A. (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, Y. , Hammerl, A. and Poças, D. (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, Y. , Noarov, G. and Schulz, A. 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, Y. and Poças, D. (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, G., Gairing, M., Giannakopoulos, Y. , Poças, D. and Waldmann, C. (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, Y. , Koutsoupias, E. and Kyropoulou, M. (2019) The anarchy of scheduling without money. Theoretical Computer Science, 778, 19 - 32. (doi: 10.1016/j.tcs.2019.01.022)
Christodoulou, G., Gairing, M., Giannakopoulos, Y. and Spirakis, P. G. (2019) The price of stability of weighted congestion games. SIAM Journal on Computing, 48(5), pp. 1544-1582. (doi: 10.1137/18M1207880)
Articles
Filos-Ratsikas, A., Giannakopoulos, Y. , Hollender, A., Lazos, P. and Poças, D. (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, Y. , Poças, D. and Tsigonias-Dimitriadis, A. (2023) Robust revenue maximization under minimal statistical information. ACM Transactions on Economics and Computation, 10(3), 11. (doi: 10.1145/3546606)
Christodoulou, G., Gairing, M., Giannakopoulos, Y. , Poças, D. and Waldmann, C. (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, A., Giannakopoulos, Y. and Lazos, P. (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, Y. , Noarov, G. and Schulz, A. 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, Y. , Koutsoupias, E. and Kyropoulou, M. (2019) The anarchy of scheduling without money. Theoretical Computer Science, 778, 19 - 32. (doi: 10.1016/j.tcs.2019.01.022)
Christodoulou, G., Gairing, M., Giannakopoulos, Y. and Spirakis, P. 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, Y. , Noarov, G. and Schulz, A. 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, A., Giannakopoulos, Y. , Hollender, A. and Kokkalis, C. (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, Y. (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, Y. and Hahn, J. (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, Y. , Grosz, A. and Melissourgos, T. (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, A., Giannakopoulos, Y. , Hollender, A., Lazos, P. and Poças, D. (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, Y. , Poças, D. and Tsigonias-Dimitriadis, A. (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, Y. , Hammerl, A. and Poças, D. (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, Y. and Poças, D. (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, G., Gairing, M., Giannakopoulos, Y. , Poças, D. and Waldmann, C. (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)
Prior publications
Article
(2019) Optimal Pricing For MHR and λ-Regular Distributions Yiannis Giannakopoulos.
(2018) Duality and Optimality of Auctions for Uniform Distributions Yiannis Giannakopoulos. (doi: 10.1137/16M1072218)
(2018) Selling Two Goods Optimally Yiannis Giannakopoulos. (doi: 10.1016/j.ic.2018.02.016)
(2017) The VCG Mechanism for Bayesian Scheduling Yiannis Giannakopoulos. (doi: 10.1145/3105968)
(2015) Bounding the Optimal Revenue of Selling Multiple Goods Yiannis Giannakopoulos. (doi: 10.1016/j.tcs.2015.03.010)
(2015) Competitive Analysis of Maintaining Frequent Items of a Stream Yiannis Giannakopoulos. (doi: 10.1016/j.tcs.2014.09.011)
Conference Proceedings
(2018) Optimal Pricing For MHR Distributions Yiannis Giannakopoulos. (doi: 10.1007/978-3-030-04612-5_11)
(2017) Online Market Intermediation Yiannis Giannakopoulos. ISBN 978-3-95977-041-5 (doi: 10.4230/LIPIcs.ICALP.2017.47)
(2015) Selling Two Goods Optimally Yiannis Giannakopoulos. (doi: 10.1007/978-3-662-47666-6_52)
(2015) The VCG Mechanism for Bayesian Scheduling Yiannis Giannakopoulos. (doi: 10.1007/978-3-662-48995-6_25)
(2014) Duality and Optimality of Auctions for Uniform Distributions Yiannis Giannakopoulos. (doi: 10.1145/2600057.2602883)
Thesis
(2015) Duality Theory for Optimal Mechanism Design Yiannis Giannakopoulos.
Book Section
(2015) Mechanism Design and Strong Truthfulness Yiannis Giannakopoulos. ISBN 978-1-61499-531-9
(2012) Competitive Analysis of Maintaining Frequent Items of a Stream Yiannis Giannakopoulos. ISBN 978-3-642-31154-3 (doi: 10.1007/978-3-642-31155-0_30)
Website
(2014) A Note on Selling Optimally Two Uniformly Distributed Goods Yiannis Giannakopoulos.
Other
(2008) Online Mechanism Design Yiannis Giannakopoulos.
Supervision
- Johannes Hahn (University of Technology Nuremberg)
Teaching
Current teaching:
- Computational Game Theory (Honours/masters Level, Semester 1)
- Practical Algorithms (Level 2 - Graduate Apprenticeship, Semester 1)
Recent teaching:
- Algorithms & Data Structures 2 (Level 2, Semester 2)
Additional information
For more details please see my personal website.
