Algorithms and Game Theory
Seminar - 0368.4617

Yossi Azar ( azar@tau.ac.il )
1st Semester, 2010/11 - Thursday 15-17, Physics/Shenkar 114
School of Computer Science,
Tel-Aviv University

Seminar outline: We follow some chapters of the book Algorithmic Game Theory.
and some extra papers

1. Oct 21 :
   Introduction
   papers distribution
   
2. Oct 28 :
   Noam Nisan: Introduction to Mechanism Design (for Computer Scientists).
   Sections 1.1-1.5 (skip 1.2.4)
   < Slides2-ppt >
   
3. Nov 4 :
   Liad Blumrosen and Noam Nisan: Combinatorial Auctions.
   Sections 1.1-1.3
   < Slides3-ppt >
   
4. Nov 11 :
   Liad Blumrosen and Noam Nisan: Combinatorial Auctions.
   Sections 1.4 partially, 1.5-1.7
   < Slides4-ppt >
   
5. Nov 18 :
   Ron Lavi: Computationally-Efficient Approximation Mechanisms.
   Sections 1.1-1.3
   < Slides5-ppt >
   
6. Nov 25 :
   Ron Lavi: Computationally-Efficient Approximation Mechanisms.
   Sections 1.4-1.5
   < Slides6-ppt >
   
7. Dec 2 :
   David C. Parkes: Online Mechanisms.
   Sections 1.1-1.3
   < Slides7-ppt >
   
8. Dec 9 :
   T. Roughgarden and E. Tardos, Introduction to the Inefficiency of Equilibria.
   Sections 17.1-17.3
   T. Roughgarden, Routing Games.
   Sections 18.1-18.2
   < Slides8-ppt >
   
9. Dec 16 :
   T. Roughgarden, Routing Games.
   Sections 18.3-18.5
   < Slides9-ppt >
   
10. Dec 23 :
    E. Tardos and T. Wexler: Network Formation Games.
    Sections 19.1-19.4
    < Slides10-ppt >
    
11. Jan 6 :
    R. Johari: Efficiency loss and the design of scalable resource allocation mechanisms.
    < Slides11-pdf >
    
12. Jan 13 :
    Andrew Goldberg, Jason Hartline, Anna Karlin, Mike Saks, and Andrew Wright: Competitive Auctions.
    < Slides12-pdf >
    

Last updated January 13, 2011