Please note: This distinguished lecture will take place in DC 1302 and virtually over Zoom.
Tim
Roughgarden,
Professor
Computer
Science
Department,
Columbia
University
Head
of
Research,
a16z
crypto
Blockchains that support a general contract layer (e.g., Ethereum) export the functionality of a general-purpose, ownerless, and open-access computer that can enforce property rights for digital data. How is such functionality implemented? Using a lot of extremely cool computer science ideas! And like everywhere else in computer science, theory plays an undeniable role in the understanding and advancement of this technology.
In this talk, I’ll highlight three examples (among many):
- Possibility and impossibility results for permissionless consensus (i.e., implementing an “ownerless” computer).
- Incentive-compatible transaction fee mechanism design (part of implementing an “open-access” computer).
- Succinct proofs of computation (for boosting the computer’s power by piggybacking on off-chain computation).
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 Social Choice and Welfare Prize, the Mathematical Programming Society’s Tucker Prize, and the EATCS-SIGACT Gödel Prize.
He was an invited speaker at the 2006 International Congress of Mathematicians, the Shapley Lecturer at the 2008 World Congress of the Game Theory Society, and a Guggenheim Fellow in 2017. He has written or edited ten books and monographs, including Twenty Lectures on Algorithmic Game Theory (2016), Beyond the Worst-Case Analysis of Algorithms (2020), and the Algorithms Illuminated book series (2017-2020).
Did you miss Tim Roughgarden’s lecture or would you like to hear it again? If so, just start the video below.