How Computer Science Informs Modern Auction Design

Name: How Computer Science Informs Modern Auction Design
Start: 2018-04-18T17:00:00-04:00
End: 2018-04-18T18:15:00-04:00
Location: Gerald D. Fischbach Auditorium

Speaker
Tim Roughgarden, Ph.D. Professor of Computer Science and Management Science and Engineering, Stanford University

Wednesday April 18, 2018

About Presidential Lectures

Presidential Lectures are free public colloquia centered on four main themes: Biology, Physics, Mathematics and Computer Science, and Neuroscience and Autism Science. These curated, high-level scientific talks feature leading scientists and mathematicians and are intended to foster discourse and drive discovery among the broader NYC-area research community. We invite those interested in the topic to join us for this weekly lecture series.

Over the last twenty years, computer science has relied on concepts borrowed from game theory and economics to reason about applications ranging from internet routing to real-time auctions for online advertising. More recently, ideas have increasingly flowed in the opposite direction, with concepts and techniques from computer science beginning to influence economic theory and practice.

In this lecture, Tim Roughgarden will illustrate this point with a detailed case study of the 2016-2017 Federal Communications Commission incentive auction for repurposing wireless spectrum. Computer science techniques, ranging from algorithms for NP-hard problems to nondeterministic communication complexity, have played a critical role both in the design of the reverse auction (with the government procuring existing licenses from television broadcasters) and in the analysis of the forward auction (when the procured licenses sell to the highest bidder).

About the Speaker

Tim Roughgarden in front of rocks

Roughgarden is a professor of computer science and, by courtesy, management science and engineering at Stanford University. He joined the Stanford faculty in 2004, following a Ph.D. at Cornell University and a postdoc at the University of California, Berkeley. His research interests include the many connections between computer science and economics as well as the design, analysis, applications and limitations of algorithms. He has received the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Social Choice and Welfare Prize, the Mathematical Programming Society’s Tucker Prize, and the EATCS-SIGACT Gödel Prize. His books include Twenty Lectures on Algorithmic Game Theory (2016) and Algorithms Illuminated (2017).