ALGORITHMIC GAME THEORY |
|
Schedule.
Week 1.-
Related Reading.
Nisan et al., Sections 1.1.1-1.3.5.
Easley and Kleinberg, Chapter 6.
Week 2.
-
Related Reading.
Nisan et al., Sections 9.1-9.2.
Easley and Kleinberg, Chapter 23.
Shoham and Leyton-Brown, Chapter 9.
[See also Three brief proofs of Arrow's impossibibility theorem by J. Geanakoplos.]
Week 3.
-
Related Reading.
See Chapter 1, "Bounded Rationality in Choice", in Modeling Bounded Rationality by A. Rubinstein.
-
Related Reading.
Nisan et al., Section 9.3.
Shoham and Leyton-Brown, Sections 10.3-10.4.3.
[For a lighter introduction to auctions, see Easley and Kleinberg, Chapter 9.]
Week 4.
-
Related Reading.
Nisan et al., Section 9.3.5.
-
Related Reading.
Some slides on VCG.
Thirteen reasons why the Vickrey-Clarke-Groves process is not practical, by M. Rothkopf.
Nisan et al., Section 9.4.
Shoham and Leyton-Brown, Section 10.2 and Section 10.4.5.
Week 5.
-
Related Reading.
See Appendix 1.A. of Auctions: Theory and Practice, by P. Klemperer.
Shoham and Leyton-Brown, Sections 11.1.1-11.1.7.
Nisan et al., Section 9.6.
-
Related Reading.
Shoham and Leyton-Brown, Section 3.3.4
Week 6.
-
Related Reading.
Nisan et al., Section 2.3.
Shoham and Leyton-Brown, Section 4.2.2.
-
Related Reading.
Easley and Kleinberg, Chapter 8.
Shoham and Leyton-Brown, Section 6.4.
Week 7.
-
Related Reading.
Easley and Kleinberg, Chapter 8.
[For a broader and deeper investigation see Nisan et al., Chapters 17 and 18.]
-
Related Reading.
See Sections 1 and 2 of Computing equilibria: a computational complexity perspective, by T. Roughgarden.
Week 8.
-
Related Reading.
See Sections 3 and 4 of Computing equilibria: a computational complexity perspective, by T. Roughgarden.
-
Related Reading.
Shoham and Leyton-Brown, Appendix B and Section 3.4.1.
An introduction to Linear Programming by S. Dasgupta, C. Papadimitriou, and U. Vazirani is here.
[The simplex algorithm (Part I and Part II) and how it gives a proof of the strong duality theorem.]
Week 9.
-
Related Reading.
Nisan et al., Sections 11.1-11.2.
An introduction to Dynamic Programming by J. Erickson is here.
-
Related Reading.
Nisan et al., Sections 28.1-28.3.
Easley and Kleinberg, Chapter 15.
Week 10.
-
Related Reading.
[The algorithm in class is based upon this paper by N. Dimitrov and G. Plaxton.]
-
Related Reading.
Nisan et al., Section 9.5.6.
Week 11.
-
Related Reading.
Some notes on general equilibria by J. Levin.
-
Related Reading.
Easley and Kleinberg, Chapter 10.
Week 12.
-
Related Reading.
Nisan et al., Section 11.3.
-
Related Reading.
Nisan et al., Section 1.8.
Week 13.
-
Related Reading.
Shoham and Leyton-Brown, Section 12.2.2.
On market games by L. Shapey and M. Shubik.
-
Related Reading.
Osborne, Section 16.3.
Myerson, Section 8.2.
Week 14.