Elias Koutsoupias
Professor of Computer Science
University of Oxford

Department of Computer Science
University of Oxford
Wolfson Building, Parks Road
Oxford, OX1 3QD, UK

Office: 368
Tel: +44 (0) 1865 610738
Email: eliας@cs.ox.ac.uk
photo

Short Biography

I am a professor of computer science at the University of Oxford.

My research interests include algorithmic aspects of game theory, economics and networks, online algorithms, decision-making under uncertainty, design and analysis of algorithms, computational complexity. I received the Gödel Prize of theoretical computer science in 2012 for my work on the price of anarchy, in reference to laying the foundations of algorithmic game theory. I am also the recipient of the ERC Advanced Grant “Algorithms, Games, Mechanisms, and the Price of Anarchy”.

I previously held faculty positions at the University of California, Los Angeles (UCLA), and the University of Athens. I 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).

Teaching

Research interests

Here are some of my papers. An almost complete list can be found at DBLP and at Google Scholar.

Optimal auctions

Some of my recent research focuses on designing auctions that extract optimal profit in Bayesian settings. At the heart of it is a duality framework with partial differential inequalities, which is useful for suggesting an optimal auction and for proving its optimality.

Game-theoretic issues of blockchain / bitcoin

Bitcoin and blockchain raise some challenging game-theoretic questions. My work is about equilibria of mining games.

Mechanism design

Some of my work improves the bounds of mechanisms for the unrelated machines scheduling problem (Nisan-Ronen problem)

Price of anarchy

The concept of the price of anarchy appeared in a joint paper with Christos Papadimitriou in 1999:

The following papers contain some followup work on the price of anarchy of finite congestion games:

Coordination mechanisms is one way to try to re-design systems to improve their price of anarchy:

Online algorithms

A large part of my research is about online algorithms.

The following is a review article on the k-server problem:

An interesting variant of the k-server problem involves infinitely many servers:

Another challenging problem is the carpool fairness problem:

Combining markets and online algorithms:

Created: 2018-01-17 Wed 11:21