Aris Filos-Ratsikas

Aris Filos-Ratsikas is a Lecturer (Assistant Professor) at the University of Edinburgh, School of Informatics, and a member of the Laboratory for Foundations of Computer Science. His research integrates theoretical computer science and economics, focusing on algorithms, computational complexity, social choice, fair division, game theory, and mechanism design.

Education:

• PhD in Computer Science, Aarhus University, Denmark (2015) – Supervisor: Peter Bro Miltersen
• MSc – Advisor: Ioannis Caragiannis

Research Interests:

His work spans social choice theory, fair division, consensus halving, necklace splitting, PPA-completeness, distortion in voting and matching, and market algorithms. He develops new techniques combining convex optimization, topology, and query complexity to solve foundational problems in economics and computation.

Recent Publication Trends:

Recent papers focus on distortion minimization in social choice and matching under limited information, FIXP-completeness for fair-division problems like envy-free cake cutting, and randomized voting rules that balance explainability and efficiency. His work frequently appears in NeurIPS, FOCS, EC, AAAI, IJCAI, and SODA.

Awards & Service:

• Fellow of the Higher Education Academy
• Teaching Assistant of the Year, Aarhus University (2014)
• Outstanding/Senior PC Member awards: AAMAS 2022, IJCAI 2018, AAAI 2017, IJCAI 2016
• Program (co-)Chair: SAGT 2023; Area Chair: EC 2023; Senior PC: WINE, AAMAS, AAAI

Teaching & Grants:

He has designed and delivered large MSc modules (Advanced Algorithmic Techniques, Programming Fundamentals) at Liverpool, and taught Algorithmic Game Theory at Oxford. His tutorials on “Total Search Problems” and “Auctions & Markets” are regularly invited to international summer schools. He holds a fellowship recognizing excellence in higher-education teaching and has produced reflective scholarship on teaching theoretical courses.

Workshops & Visits:

He co-organizes the UK-wide “Indoor Games” workshop series and multiple international workshops on fairness, distortion, and total search problems. Long-term visits have included Oxford (hosted by Elias Koutsoupias) and Tsinghua University (hosted by Andrew Yao).