Broad Area Colloquium For AI-Geometry-Graphics-Robotics-Vision

Some Interesting Problems at the Interface of Computer Science and Game Theory

Yoav Shoham
Department of Computer Science
Stanford University

Monday, Nov 27, 2000, 4:15PM
TCseq200, Lecture Hall A


The problems that lie at this interface span a broad range. In this version of my generically titled talk I'll cover three pieces of work that we've been involved with in recent years. All three have to do with auctions, and they range from the immediately useful (but perhaps mundane) to the rather useless (but beautiful, imo). They are, in order: (1) Taming the computational complexity of combinatorial auctions (with Kevin Leyton-Brown, among others), (2) Trading off economic efficiency and computational efficiency (with Daniel Lehmann and Liadan O'Callahan), and (3) Rational computability (with Moshe Tennenholtz).

About the Speaker

Coming soon.
Back to the Colloquium Page
Last modified: Thu Oct 19 18:18:43 PST 2000