Email: argyrios.deligkas at rhul.ac.uk
Computational Complexity
Algorithmic Game Theory
Mechanism Design
Combinatorial Optimization
Parameterized Complexity
Equilibrium Computation
September 2025: New paper on Arxiv! "Mechanism Design with Outliers and Predictions", with Eduard Eiben, Sophie Klumper, Guido Schäfer, and Artem Tsikiridis.
September 2025: Eduard Eiben, Tiger-Lily Goldsmith and I, visited for a week Rober Ganian at Vienna!
June 2025: Eduard Eiben, Tiger-Lily Goldsmith and I, visited for a week Dušan Knop, and Šimon Schierreich at Prague!
June 2025: I have attended ALGA2025 at beautiful Sardinia, where I have given a talk on computation of approximate Nash equilibria!
May 2025: I visited Scotland for a week! At Glasgow I gave a talk on temporal graphs at the FATA seminar and at Edinburgh I gave a talk on fair division with set restrictions at the Econ/CS seminar.
May 2025: Our paper "EF1 and EFX Orientations", with Eduard Eiben, Tiger-Lily Goldsmith, and Viktoriia Korchemna got accepted at IJCAI 2025!
April 2025: Our paper "Routing Few Robots in a Crowded Network", with Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, and M. S. Ramanujan got accepted at WADS 2025!
April 2025: Our paper "Pizza Sharing is PPA-hard", with John Fearnley and Themistoklis Melissourgos got accepted at ACM Transactions on Computation Theory!
April 2025: The Special issue on Economics and Computation at IPL, co-edited with Aris Filos-Ratsikas and Alexandros Voudouris is now online!
March 2025: New paper on Arxiv! "Balanced and Fair Partitioning of Friends", with Eduard Eiben, Stavros Ioannidis, Dušan Knop, and Šimon Schierreich.
March 2025: New paper on Arxiv! "The Complexity of Extending Fair Allocations of Indivisible Goods", with Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, and Stavros Ioannidis.
January 2025: Our paper "Agent-Constrained Truthful Facility Location Games", with Mohammad Lotfi, and Alexandros Voudouris got accepted at the Journal of Combinatorial Optimization!
December 2024: Our paper "Fixed-Parameter Algorithms for Multiagent Pathfinding on Trees", with Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan got accepted at AAMAS 2025!
December 2024: Three papers were accepted at AAAI 2025! 🥳
(1) "How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs", with Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, and Georg Tennigkeit.
(2) "Balanced and Fair Partitioning of Friends", with Eduard Eiben, Stavros Ioannidis, Dusan Knop, and Simon Schierreich.
(3) "The Complexity of Extending Fair Allocations of Indivisible Goods", with Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, and Stavros Ioannidis.
December 2024: I have delivered a tutorial on Computation of Nash Equilibria: Recent Advances in Algorithms and Complexity at WINE 2024 at Edinburgh.
October 2024: Our paper "Constant Inapproximability for PPA", with John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos got accepted at SICOMP journal!