Parks Road, Oxford OX1 3QD
My research interests include algorithmic aspects of game theory, economics and networks, online algorithms, decision-making under uncertainty, distributed algorithms, design and analysis of algorithms, computational complexity.
My profile in Google Scholar and DBLP.
Elias Koutsoupias is a professor of computer science at the University of Oxford. His research interests include algorithmic aspects of game theory, economics and networks, online algorithms, decision-making under uncertainty, design and analysis of algorithms, computational complexity. He received the Gödel Prize of theoretical computer science in 2012 for his work on the price of anarchy, in reference to laying the foundations of algorithmic game theory. He is also the recipient of the ERC Advanced Grant “Algorithms, Games, Mechanisms, and the Price of Anarchy”.
He previously held faculty positions at the University of California, Los Angeles (UCLA) and the University of Athens. He studied at the National Technical University of Athens (B.S. in electrical engineering) and the University of California, San Diego (Ph.D. in computer science).
Elias Koutsoupias and Christos H. Papadimitriou
In Computer Science Review. Vol. 3. No. 2. Pages 65−69. 2009.
Details about Worst−case equilibria | BibTeX data for Worst−case equilibria
The k−server problem
In Computer Science Review. Vol. 3. No. 2. Pages 105−118. 2009.
Details about The k−server problem | BibTeX data for The k−server problem
- Online Algorithms
- Foundational Issues in Computational Learning
- Algorithms At Large
- Algorithmic Game Theory and Computational Economics