Paul G. Spirakis

Papers

Total Citations

H-Index

About

Paul G. Spirakis is a towering figure in theoretical computer science, whose work has fundamentally shaped our understanding of algorithmic game theory, distributed computing, and the probabilistic analysis of algorithms. A pioneer in the study of algorithmic mechanisms for selfish agents, Spirakis has made seminal contributions to the design and analysis of protocols for resource allocation and network formation, often bridging the gap between worst-case and average-case complexity. His research on the price of anarchy and the complexity of equilibria in games has been highly influential, with many of his papers garnering thousands of citations. Notably, his work on "Collision-Free Robot Scheduling" (2024) continues his legacy of tackling foundational problems with elegant, rigorous solutions. A member of the Academia Europaea and a recipient of the EATCS Award for his lifetime contributions, Spirakis’s impact is felt across computer science, from foundational theory to practical algorithms. His prolific career, spanning decades, has inspired generations of researchers to explore the intersection of computation, economics, and randomness.