The Communication Complexity of Combinatorial Auctions in Graphs - Elias Koutsoupias (University of Oxford, UK)

Title: The Communication Complexity of Combinatorial Auctions in Graphs

Speaker: Professor Elias Koutsoupias (University of Oxford, UK)

Abstract: This talk is about truthful and non-truthful protocols for combinatorial auctions in which every item can be allocated to one of two agents (multigraphs), or more generally to a fixed number of agents (hypergraphs). We will discuss some recent results for the communication complexity of approximating the optimal social welfare for general monotone, subadditive, or XOS valuations.

Short 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. 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).

________________________________________________________________________________