Gilbert Fridgen is Full Professor in Digital Financial Services and holder of the PayPal-FNR PEARL Chair at the University of Luxembourg's Interdisciplinary Centre for Security, Reliability and Trust (SnT). He leads the FINATRAX research group focusing on blockchain, digital identity, and sustainable digital solutions. His research explores decentralized technologies in finance, energy systems, and public administration. Current projects investigate blockchain applications in industrial demand response, NFT markets, EU digital identity wallets, and DeFi institutional adoption. Prof. Fridgen examines the intersection of technology with regulatory frameworks and user behavior in energy and financial systems. He collaborates extensively with industry partners including PayPal and Spuerkeess. Prof. Fridgen actively contributes to EU digital policy discussions, particularly regarding the European Digital Identity Wallet framework and decentralized finance governance.
Katerina Sotiraki is an Assistant Professor in the Department of Computer Science at Yale University, associated with the Archimedes AI research group. Her work focuses on theoretical cryptography, post-quantum cryptography, complexity theory, and secure computation. She holds a Ph.D. (2020) and M.S. (2016) in Computer Science from MIT, and a B.S. in Applied Mathematics (2013) from the National Technical University of Athens. Prior to Yale, she was a postdoc at UC Berkeley working with Raluca Ada Popa and Alessandro Chiesa, under the guidance of Vinod Vaikuntanathan at MIT. Research Interests : Design and analysis of cryptographic protocols resilient to quantum computing Efficient zero-knowledge proofs and succinct arguments Algorithmic game theory and fair division problems Lattice-based cryptography and post-quantum security Awards & Honors : Winner of 7th iDASH Competition (Track 3) - 2018 Chateaubriand Fellowship - 2018 Paris C. Kanellakis Fellowship (MIT EECS) - 2013 Key Contributions : Developed HOLMES - a system for secure collaborative learning Pioneered lattice-based succinct arguments with polylogarithmic verification Advanced understanding of modulo-p arguments through topological methods Labs & Teams : Active member of the Archimedes AI group at Yale, focusing on secure computation and cryptographic protocols.
Kristoffer Arnsfelt Hansen is an Associate Professor at the Department of Computer Science, Aarhus University. His research focuses on algorithmic game theory, computational complexity, and equilibrium computation in multi-player games. He explores topics such as stochastic games, Nash equilibria, convex optimization, and fair division. His work bridges theoretical computer science with economic applications, particularly in mechanism design and market analysis. Selected publications include studies on PPAD-membership via convex optimization, complexity of Pareto-optimal lotteries, and the computational challenges in analyzing Nash equilibria. He has contributed to conference proceedings like WINE 2022 and SAGT 2021, showcasing his engagement with international research communities. Research interests emphasize theoretical foundations of game theory with practical implications for resource allocation, fair division, and multi-agent systems. His work often intersects with complexity theory, exploring boundaries of efficient computation in economic and strategic scenarios. No awards or grants are explicitly mentioned in the provided data. Advising activities and lab affiliations are not detailed here.
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).
Themistoklis Melissourgos is a Lecturer (Assistant Professor) in the School of Computer Science and Electronic Engineering at the University of Essex. He is a member of the Artificial Intelligence research group and the Centre for Computational Finance and Economic Agents. Prior to joining Essex, he held postdoctoral positions at TU Munich in the Operations Research group under Prof. Andreas S. Schulz, and at the University of Liverpool. PhD in Computer Science, University of Liverpool (supervised by Prof. Paul Spirakis) BSc in Electrical and Computer Engineering, University of Patras His research lies at the intersection of Theoretical Computer Science and Economics , with a primary focus on Algorithmic Game Theory and Computational Social Choice . He investigates the computational complexity of problems in these domains and develops exact and approximation algorithms. His work often addresses fundamental questions in market equilibria, fair division, and strategic computation. The recent publications of Dr. Melissourgos span top-tier conferences such as FOCS , STOC , ICALP , AAAI , and AAMAS . A clear trend in his work is the establishment of strong inapproximability results for problems in computational economics and game theory, particularly within complexity classes like PPAD and PPA. His research on the Pure-Circuit problem and consensus halving has provided foundational hardness results. He also explores applications in computational finance, such as optimizing trading strategies with genetic algorithms. Scientific Service: Program Committees: AAMAS 2025, ECAI 2024/2025, SAGT 2022/2023/2025, IJCAI 2021-2024, AAAI 2020/2023-2025 Reviewer: For numerous top conferences (STOC, FOCS, SODA, etc.) and journals (JACM, SICOMP, etc.) Organizing: SAGT 2016, MFCS 2018; Co-organized seminars on Complexity of Total Search Problems and Fair Division at TU Munich Dr. Melissourgos has an active teaching record, having served as a Teaching Assistant and Instructor at the University of Liverpool for courses in algorithms, AI, and computational game theory. At the University of Essex, he is a Module Supervisor for courses in quantitative finance and financial engineering. He has not been awarded any specific scientific prizes mentioned in the text, and there is no information about research grants. He has not published a list of advisees, suggesting he may be early in his faculty career. He is actively involved in his research community and contributes significantly to the academic service of his field.
