How Computer Science Informs Modern Auction Design

Wednesday, November 1, 2017
11:30 AM - 1:00 PM
Add to Calendar

Link added to clipboard:

https://events.columbia.edu/cal/event/eventView.do?b=de&calPath=%2Fpublic%2Fcals%2FMainCal&guid=CAL-00bbdcc6-5f5cdc90-015f-5e1cd841-00000910events@columbia.edu&recurrenceId=
Economists have studied the theory and practice of auctions for decades. How can computer science contribute? Using the recent U.S. FCC double-auction for wireless spectrum as a case study, Tim Roughgarden from Stanford University will illustrate the many answers: novel auction formats, algorithms for NP-hard problems, approximation guarantees for simple auctions, and communication complexity-based impossibility results.

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a PhD in Computer Science from Cornell in 2002.

His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. For his research, he has been awarded 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 Shapley Lecturership of the Game Theory Society, the Social Choice and Welfare Prize, INFORM’s Optimization Prize for Young Researchers, the Mathematical Programming Society’s Tucker Prize, the EATCS-SIGACT Gödel Prize, and a Guggenheim Fellowship.
LOCATION:
  • Morningside
TYPE:
  • Lecture
CATEGORY:
  • Engineering
  • Computer Science
EVENTS OPEN TO:
  • Students
  • Faculty
  • Staff
BACK TO EVENTS

Date Navigation Widget

Filter By

Subscribe Export Options

Getting to Columbia

Other Calendars

Guests With Disabilities