some useful pdfs from a course: ______________________________________________________________________________
- Introduction
A Course in Game Theory Martin J. Osborne, Ariel Rubinstein
http://www.cs.tau.ac.il/~mansour/course_games/scribe/lecture1.pdf
______________________________________________________________________________
- Coordination Ratio: Job scheduling
Worst-case Equilibria Koutsoupias and Papadimitriou Tight Bounds for Worst-Case Equilibria
A. Czumaj and B. Vocking
http://www.cs.tau.ac.il/~mansour/course_games/scribe/lecture2.pdf
Marios Mavronicolas
______________________________________________________________________________
- Coordination Ratio: Selfish Routing
How Bad is Selfish Routing?
Roughgarden and Tardos
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture3.pdf
Tim Roughgarden
______________________________________________________________________________
- Zero Sum games
Game Theory
Owen
Adaptive game playing using multiplicative weights
Freund and Schapire
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture4.pdf
______________________________________________________________________________
- General sum games: Nash
BrouwerLemma
http://www.mathpages.com/home/kmath262/kmath262.htm
Playing large games using simple strategies
Lipton, Markakis and Mehta
Complexity results about Nash Equilibrium
Conitzer and Sandholm
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture5.pdf
______________________________________________________________________________
- Congestion and Potential Games
Potential Games
http://www.cs.tau.ac.il/~mansour/sem-game-02-03/monderer-potential-96.pdf
Monderer and Shapley
On the complexity of pure equilibria
http://www.cs.berkeley.edu/~christos/papers/pure.ps
Fabrikant, Papadimitriou and Talwar
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture6.pdf
Christos H. Papadimitriou
http://www.cs.berkeley.edu/~christos/
______________________________________________________________________________
- Extensive form and Repeated Games
A Course in Game Theory Martin J. Osborne, Ariel Rubinstein
Parts of Chapters 6 & 8
On Bounded Rationality And Computational Complexity
http://citeseer.ist.psu.edu/486020.html
Papadimitriou and Yannakakis
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture7.pdf
______________________________________________________________________________
- External and Internal Regret
**From External to Internal Regret**Blum and Mansour
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture8.pdf
Nicolò Cesa-Bianchi
Sergiu Hart
______________________________________________________________________________
- Dynamics in Load balancing & Routing
Convergence Time to Nash Equilibria
Even-Dar, Kesselman &Mansour
Fast Convergance to Selfish Routing
Even-Dar & Mansour
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture9.pdf
______________________________________________________________________________
- Mechanism Design & Social Choice
Mechanism Theory
M. Jackson
Three Brief proofs of Arrows impossibility results
J. Geanakoplos
A Gibbard-Satterthwaite theorem: a simple proof
J. Benoit
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture10.pdf
______________________________________________________________________________
11 Combinatorial Auctions
Truth revelation in approximately efficient combinatorial auctions
http://robotics.stanford.edu/~shoham/LOS-JACM(proof).pdf
Lehmann, O’Callaghan & Shoham
**Incentive compatible multi unit combinatorial auctions**Bartal, Gonen & Nisan
http://www.math.tau.ac.il/~mansour/course_games/scribe/lecture11.pdf
Noam Nisan
Tuomas Sandholm