• Ioannis Panageas
  • Welcome
  • Publications
  • Teaching
  • Contact
    Ioannis (Yannis) Panageas

    Ioannis (Yannis) Panageas

    • Google Scholar

    CS 295 - Introduction to Algorithmic Game Theory

    Below we will be posting slides and lecture notes for the class.

    Lecture no.TopicsReading
    Lecture 1Administrivia, Introduction
    Lecture 2Definitions and Existence of NELecture notes
    Lecture 3LP Duality and zero-sum gamesLecture notes
    Lecture 4No-regret and a proof of minimax TheoremLecture notes
    Lecture 5Algorithms for computing Nash in two-player gamesLecture notes
    Lecture 6Potential and Congestion Games
    Lecture 7Price of AnarchyLecture notes
    Lecture 8Complexity Classes and AGTLecture notes
    Lecture 9PLS and PPAD reductionsLecture notes
    Lecture 10Other notions of equilibriaLecture notes
    Lecture 11Intro to Mechanism DesignLecture notes
    Lecture 12Monotone allocations and Myerson’s lemmaLecture notes
    Lecture 13Virtual valuations and reserve pricesLecture notes
    Lecture 14Arrow’s and Gibbard-Satterthwaite theoremLecture notes
    Lecture 15Randomized Voting
    Lecture 16Introduction to Markets
    Lecture 17More on Markets
    Lectures 18-20Paper Presentations
    © 2025 Ioannis (Yannis) Panageas. Powered by Jekyll & AcademicPages, a fork of Minimal Mistakes.