Workshop on
COMPLEXITY IN ECONOMIC THEORY

September 12–14, 2003

Friday, September 12
9:30–12:00 Yishay Mansour (Tel-Aviv University), "Tutorial: Computational Complexity"
12:00–1:30 Lunch
1:30–2:30 Andrew Postlewaite (University of Pennsylvania), "Complexity vs. Accuracy: A Complex Trade-off" AND "The Complexity of Contracts"
3:00–4:00 Craig Tovey (Georgia Tech), "A Positive and a Negative Application of Complexity to Voting Theory"
4:00–5:00 Joseph Halpern (Cornell), "Rational Secret Sharing and Multi-Party Function Evaluation"

Saturday, September 13
9:30–10:30 Yishay Mansour (Tel-Aviv University), "Convergence Time to Nash Equilibria in Load Balancing"
11:00–12:00 Rahul Savani (LSE), "Long Lemke–Howson Paths"
12:00–1:30 Lunch
1:30–2:30 Sham Kakade (Penn), "Graphical Economics"
3:00–4:00 Christian Shelton (Stanford), "Compact Structured Game Representations"
4:00–5:00 Bernhard von Stengel (LSE), "Extensive Form Correlated Equilibria"

Sunday, September 14
9:30–10:30 Moshe Tenneholtz (Technion), "Bundling Equilibrium: Economic Efficiency vs. Communication Efficiency in the VCG Mechanisms"
11:00–12:00 Ilya Segal (Stanford), "The Communication Requirements of Social Choice Rules"
12:00–1:30 Lunch
1:30–2:30 Joan Feigenbaum (Yale), "Algorithmic Mechanism Design for Interdomain Routing"
3:00–4:00 Tuomas Sandholm (Carnegie Mellon University), "Automated Mechanism Design"
4:00–5:00 Christos Papadimitriou (Berkeley), "Complexity Aspects of Game Theory"