IfI Colloquium: Incentive Auctions and Spectrum Repacking: A Case Study for "Deep Optimization", November 9, 2017

Speaker: Prof. Kevin Leyton-Brown, Ph.D.
University of British Columbia, Canada

Date: Thursday, November 9, 2017, 17:15 h

Location: BIN 2.A.01


Over 13 months in 2016-17 the US Federal Communications Commission conducted an "incentive auction" to repurpose radio spectrum from broadcast television to wireless internet. In the end, the auction yielded $19.8 billion USD, $10.05 billion USD of which was paid to 175 broadcasters for voluntarily relinquishing their licenses across 14 UHF channels. Stations that continued broadcasting were assigned potentially new channels to fit as densely as possible into the channels that remained. The government netted more than $7 billion USD (used to pay down the national debt) after covering costs (including retuning). A crucial element of the auction design was the construction of a solver, dubbed SATFC, that determined whether sets of stations could be "repacked" in this way; it needed to run every time a station was given a price quote.

This talk describes the process by which we built SATFC and its impact on the auction. We adopted an approach we dub "deep optimization", taking a data-driven, highly parametric, and computationally intensive approach to solver design. More specifically, to build SATFC we designed software that could pair both complete and local-search SAT-encoded feasibility checking with a wide range of domain-specific techniques, such as constraint graph decomposition and novel caching mechanisms that allow for reuse of partial solutions from related, solved problems. We then used automatic algorithm configuration techniques to construct a portfolio of eight complementary algorithms to be run in parallel, aiming to achieve good performance on instances that arose in proprietary auction simulations. We found that within the short time budget required in practice, SATFC solved more than 95% of the problems it encountered. Furthermore, simulation results showed that the incentive auction paired with SATFC produced nearly optimal allocations in a restricted setting and substantially outperformed other alternatives at national scale.


Prof. Kevin Leyton-Brown, Ph.D., is a professor of Computer Science at the University of British Columbia and an associate member of the Vancouver School of Economics. He holds a PhD and M.Sc. from Stanford University (2003; 2001) and a B.Sc. from McMaster University (1998). He studies the intersection of computer science and microeconomics, addressing computational problems in economic contexts and incentive issues in multiagent systems. He also applies machine learning to the automated design and analysis of algorithms for solving hard computational problems. He has co-written two books, "Multiagent Systems" and "Essentials of Game Theory," and over 100 peer-refereed technical articles. He is the recipient of UBC's 2015 Charles A. McDowell Award for Excellence in Research, a 2014 NSERC E.W.R. Steacie Memorial Fellowship—previously given to a computer scientist only 10 times since its establishment in 1965—and a 2013 Outstanding Young Computer Science Researcher Prize from the Canadian Association of Computer Science. He has co-taught two Coursera courses on "Game Theory" to over half a million students, and is chair of the ACM Special Interest Group on Electronic Commerce.