CS 6840 : Lecture Schedule (tentative for the future) and
· Wednesday, Jan 25: introduction and overview, see notes
· Friday, Jan 27: non-atomic congestion game (routing), see notes and Section 11 in Roughgarden
· Monday, Jan 30: Price of anarchy bound in routing games, see notes and Section 11 in Roughgarden
· Wednesday, Feb 1: Overprovisioning in routing, see notes and Section 12 in Roughgarden.
problem set 1 available on CMS
· Friday, Feb 3: existence of equilibria in congestion games, potential games, and best response, see notes, Section 13 of Roughgarden and Section 18.3 of the AGT book.
· Monday, Feb 6: price of anarchy in atomic congestion games, see notes, and/or Section 12 of Roughgarden
· Wednesday, Feb 8: a recipe for price of anarchy bound: smoothness, see notes, and/or Section 14 of Roughgarden
· Friday, Feb 10: robustness of PoA in smooth games, mixed Nash equilibria and coarse correlated equilibria, see notes and/or Section 13 of Roughgarden
· Monday, Feb 13: Correlated and Coarse Correlated equilibria, and NP completeness finding the best (coarse correlated) equilibrium, see notes, and Section 13 of Roughgarden
· Wednesday, Feb 15: Best-Case Analysis and strong Nash equilibria, see notes, and Section 15 of Roughgarden
· Friday, Feb 17: learning in games: no-regret learning, learning outcomes and its connection to CCE, see notes and section 17 of Roughgarden
· Monday, Feb 20: FEBRUARY BREAK
· Wednesday, Feb 22: The multiplicative Weight Algorithm, see notes, and section 17 of Roughgarden, problem set 2 available on CMS
· Friday, Feb 24: no-regret learning and two person 0-sum games, see notes, and section 18.3 of Roughgarden
· Monday, Feb 27: learning in games with realistic feedback, see notes.
· Monday, March 6: All pay Auction as a game, smoothness proof for the quality of outcomes, see notes.
· Wednesday, March 8: Revenue equivalence: Myerson's lemma, see notes, and section 3.3 of Roughgarden
· Wednesday, March 15: Cornell closed due to snow
· Friday, March 17: The smoothness framework and Bayes-Nash equilibria of second prize multi-item auctions, see notes.
· Monday, March 20: The generalized second price auction (GSP), and Nash equilibria, and its price of anarchy, see a draft of the notes
· Wednesday, March 22: limit of price of anarchy results correlation, and learning outcomes in auction games, see notes
· Friday, March 24: classes of valuations: submodular, subadditive and fractionally subadditive, see notes
· Monday, March 27: more on valuations, see draft of notes
· Wednesday, March 29: price of anarchy and players with fractionally subadditive valuations, see notes
· Friday, March 31: discussion of some problem set 2 questions, see notes with discussion of problem (4a’) fixed on April 8
· April 1-9: SPRING BREAK
· Wednesday, April 12: truthful auctions/mechanism: the Vickrey-Clarke-Groves mechanism, see notes
· Friday, April 14: empirical price of anarchy: on routing, and inferring player values in auctions. For the routing example, see notes, and the paper Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker: On selfish routing in internet-like environments. SIGCOMM 2003: 151-162
· Monday, April 16: inferring player values in auctions in Bayesian environments or assuming players are no-regret learners, see notes and Econometrics for Learning Agents by Denis Nekipelov, Vasilis Syrgkanis, Eva Tardos, EC 2015.
· Wednesday, April 18: bounding the empirical price of anarchy without inferring player values, see notes, and Robust Data-Driven Efficiency Guarantees in Auctions by Darrell Hoy, Denis Nekipelov, Vasilis Syrgkanis
· Friday, April 20: finishing empirical price of anarchy and (1-1/e) bound for first price auction.
More upcoming topics: Auction design using data
· Effect of budgets in games
· Simple vs optimal auction: learning optimal auction from data
· A/B testing in auctions