Course schedule (evolving) and Lecture Topics

·       Monday 8/25— Introduction (course topics and an example)

o   See the nodes from lecture, the scribe notes, and Sections 1.2 and 1.3 of Roughgarden’s book.

·       Wednesday 8/27— Game Theory Basics: Nash equilibrium, correlated equilibrium,

o   See the scribe notes, and Sections 13.1 of Roughgarden’s book.

·       Friday 8/30— More on equilibria, including coarse correlated equilibrium, existence and computing them

o   See the scribe notes, and Sections 13.1 of Roughgarden’s book.

·       Monday 9/1— Labor Day, no class

·       Wednesday 9/3— Weighted Majority learning algorithm (lecture by Bobby Kleinberg)

o   See the scribe notes, ipad notes from lecture, and Section 1.2 of Roth’s lecture notes.

·       Friday 9/5— Hedge as a No-regret Learning Algorithm (lecture by Bobby Kleinberg)

o   See the scribe notes, or ipad notes from lecture, and Section 1.3 of Roth’s lecture notes or Section 17.1-17.3 in Roughgarden’s book.

·       Monday 9/8— No-regret learning and the Course correlated equilibria

o   See the scribe notes, ipad notes from lecture, and Section 17.4 in Roughgarden’s book.

·       Wednesday 9/10— The Hotelling Game and Price of Anarchy

o   See the scribe notes, ipad notes from lecture, and Section 14 in Roughgarden’s book

·       Friday 9/12—Price of Anarchy for Mixed Nash and Coarse correlated equilibria

o   See the scribe notes,  ipad notes from lecture (with a few expectation signs added), and Section 14 in Roughgarden’s book

·       Monday 9/15—Price of anarchy in cost-minimization games and the atomic routing game

o   See the scribe notes, the ipad notes from lecture, and Section 13 in Roughgarden’s book

·       Wednesday 9/17— Price of anarchy in atomic routing game

o   See the scribe notes, the ipad notes from lecture, and Section 11 in Roughgarden’s book

·       Friday 9/19 — Non- atomic routing game and it’s Price of anarchy

o   See the scribe notes, the ipad notes from lecture, and Section 11 in Roughgarden’s book

·       Monday 9/22 —Price of anarchy in non- atomic routing game (cont.)

o   See the scribe notes, the ipad notes from lecture, Sections 11 in Roughgarden’s book

·       Wednesday 9/24 — Overprovisioning in non- atomic routing game and finding Nash and Optimal solution by convex optimization

·       See the scribe notes,  ipad notes from lecture, Section 12 in Roughgarden’s book

·       Friday 9/26 — finding Nash for routing and Potential games

o   See the scribe notes, ipad notes from lecture, Sections 13.3 in Roughgarden’s book

·       Monday 9/29 —Potential games and the price of stability

o   See the scribe notes, ipad notes from lecture, Sections 15.1-2 in Roughgarden’s book

·       Wednesday 10/01 —Auction as a game

o   See the scribe notes,  ipad notes from lecture, Section 2 in Roughgarden’s book.

·       Friday 10/03 —Price of anarchy in auctions: framework and first example: first price

o   See the scribe notes,  ipad notes from lecture, and the survey The Price of Anarchy in Auctions.

·       Monday 10/06 — GFP and GSP: Auction used for search ads and the Price of Anarchy for these auctions

o   See  the scribe notes, ipad notes from lecture, the paper Bounding the inefficiency of outcomes in generalized second price auctions

·       Wednesday 10/08 — more on GSP: Auction used for search ads

o   See the scribe notes, ipad notes from lecture, the paper Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords 

·       Friday 10/10 —GSP PoS continued

o   See the scribe notes, ipad notes from lecture, the paper Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords.

·       Monday 10/13— Fall break, no class

·       Wednesday 10/15 —Individual item auctions when more items are available

o   See the scribe notes, ipad notes from lecture, and the survey The Price of Anarchy in Auctions.

·       Friday 10/17 —Better learning we need for the games we discussed recently (follow the perturbed leader)

o   See the scribe notes,  ipad notes from lecture, and Section 1.4 of Roth’s lecture notes

·       Monday 10/20 —Follow the Perturbed Leader continued

o   See the scribe notes,  ipad notes from lecture, Section 1.4 of Roth’s lecture notes

·       Wednesday 10/22 —Learning without access to full information

o   See the scribe notes,   ipad notes from lecture (by Giannis Fikioris), Section 1.4 of Roth’s lecture notes

·       Friday 10/24 — Better models of valuations in item auctions when more items are available

o    See the scribe notes,   ipad notes from lecture (by Cristian Palma Foster),  and the survey The Price of Anarchy in Auctions

·       Monday 10/27 — No-regret learning in 2-person 0-sum games, and existence of Nash in general finite games

o    See the scribe notes,   the ipad notes from lecture, Chapter 2 of Roth’s lecture notes or Section 18.3 and 18.4 in Roughgarden’s book

·       Wednesday 10/29 — Difficulty in bidding in auctions 

o    See the scribe notes,  the ipad notes from lecture,  and the paper Learning in auctions: Regret is hard, envy is easy

·       Friday 10/31 — Follow the Perturbed Leader in Auctions 

o    See the scribe notes,  ipad notes from lecture,  the paper Learning in auctions: Regret is hard, envy is easy

·       Monday 11/3 — Price of Anarchy in item auctions with more complex valuations

o    See the scribe notes,  ipad notes from lecture,  and the survey The Price of Anarchy in Auctions

·       Wednesday 11/05 — Bayesian auctions

o    See the scribe notes,  the ipad notes from lecture,  and the survey The Price of Anarchy in Auctions

·       Friday 11/7 — Playing against a no-regret learner

o    See the scribe notes,  the ipad notes from lecture,  and the papers paper Strategizing against No-regret Learners and Selling to a no-regret buyer

·       Monday 11/10 — More robust learning: Swap regret

o   See the scribe notes,  ipad notes from lecture,  and the papers Strategizing against No-regret Learners  and Strategizing against Learners in Bayesian Games

·       Wednesday 11/12 — How to guarantee Swap regret

o   See the scribe notes,  the ipad notes from lecture and Chapter 3 of Roth’s lecture notes or a simpler description just for swap-regret in the paper From External to Internal Regret.

·       Friday 11/14 — Extensive form games subgame perfect equilibrium

o   See the ipad notes from lecture, and chapter 3 of Algorithmic Game Theory or the book Game theory Basics by Bernhard von Stengel

·       Monday 11/17 — Fining equilibria in 2-person 2-sum extensive form games  using a lathe linear program

o   See the ipad notes from lecture, and chapter 3 of Algorithmic Game Theory or the book Game theory Basics by Bernhard von Stengel

·       Wednesday 11/19 —Finding equilibria in 2-person 2-sum extensive form games continued

o   See the scribe notes,  the ipad notes from lecture, and chapter 3 of Algorithmic Game Theory or the book Game theory Basics by Bernhard von Stengel

·       Friday 11/21 —Learning in extensive form games

o   See the scribe notes,  the ipad notes from lecture, and the papers Regret Minimization in Games with Incomplete Information, Coarse Correlation in Extensive-Form Games and for corelated equilibrium see Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium

·       Monday 11/24—Learning in extensive form games (continued)

o   See  the scribe notes,  the ipad notes from lecture, and the papers Regret Minimization in Games with Incomplete Information, Coarse Correlation in Extensive-Form Games and for corelated equilibrium see Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium

·       Wednesday 11/26-Friday 11/28 Thanksgiving break

·       Monday 12/1 — Bandwidth sharing and PoA via equilibrium analysis

o   See  the scribe notes,  the ipad notes from lecture, and the paper Efficiency loss in a network resource allocation game

·       Wednesday 12/3 — Strong PoA (collaborative Nash and the PoA)

o   See the ipad notes from lecture, and the paper Strong Equilibrium in Cost-Sharing Connection Games

·       Friday 12/5 — Bargaining and collaborative Solutions with transfer: the core

o   See the ipad notes from lecture.

·       Monday 12/8 — short project presentations

                                              i.     Gabe Sekeres

                                            ii.     Aaron Harnish, Maria Massari

                                          iii.     Andrew Lowitt, Mahitha Penmetsa

                                          iv.     Leon Huang, Zephan Sanghani, Nikil Shyamsunder