Elias Koutsoupias
Professor of Computer Science
Department of Computer Science
University of Oxford
United Kingdom
Biography
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).
Research Interest
Elias Koutsoupias's 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.
Publications
-
Bhattacharya S, Koutsoupias E, Kulkarni J, Leonardi S, Roughgarden T, Xu X. Near-optimal multi-unit auctions with ordered bidders. InProceedings of the fourteenth ACM conference on Electronic commerce 2013 Jun 16 (pp. 91-102). ACM.
-
Fiat A, Karlin A, Koutsoupias E, Vidali A. Approaching utopia: strong truthfulness and externality-resistant mechanisms. InProceedings of the 4th conference on Innovations in Theoretical Computer Science 2013 Jan 9 (pp. 221-230). ACM.
-
Koutsoupias E, Vidali A. A lower bound of 1+ φ for truthful scheduling mechanisms. InInternational Symposium on Mathematical Foundations of Computer Science 2007 Aug 26 (pp. 454-464). Springer, Berlin, Heidelberg.
-
Koutsoupias E, Pierrakos G. On the Competitive Ratio of Online Sampling Auctions. InWINE 2010 Dec 13 (pp. 327-338).