• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Approximating Competitive Equilibria: A History
Kenneth J. Arrow, Stanford University 
–
Break
–
On Algorithmic Game Theory I
Christos Papadimitriou, UC Berkeley
–
Lunch
–
Scarf's Lemma and Applications I
Rakesh Vohra, University of Pennsylvania 
–
Break
–
Near-Optimal Equilibria I
Tim Roughgarden, Stanford University
–
Coffee and Check-In
–
On Algorithmic Game Theory II
Christos Papadimitriou, UC Berkeley
–
Break
–
Scarf's Lemma and Applications II
Rakesh Vohra, University of Pennsylvania 
–
Lunch
–
Near-Optimal Equilibria II
Tim Roughgarden, Stanford University
–
Break
–
Lightning Talks
Long-Term Visitors
–
Coffee and Check-In
–
Multi-Dimensional and Non-Linear Mechanism Design and Approximation I
J, ason Hartline, Northwestern University
–
Break
–
Learning in Games I
Drew Fudenberg, Harvard University 
–
Lunch
–
Complexity and Algorithmic Game Theory I
Constantinos Daskalakis, Massachusetts Institute of Technology
–
Break
–
Lightning Talks
Long-Term Visitors
–
Coffee and Check-In
–
Multi-Dimensional and Non-Linear Mechanism Design and Approximation II
J, ason, Hartline, Northwestern University
–
Break
–
Learning in Games II
Drew Fudenberg, Harvard University 
–
Lunch
–
Complexity and Algorithmic Game Theory II
Constantinos Daskalakis, Massachusetts Institute of Technology
–
Break
–
Lightning Talks
Long-Term Visitors