Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Stanford University: (CS364A) Algorithmic Game Theory #19

Open
20 tasks
murka opened this issue Nov 21, 2024 · 0 comments
Open
20 tasks

Stanford University: (CS364A) Algorithmic Game Theory #19

murka opened this issue Nov 21, 2024 · 0 comments
Labels
Math

Comments

@murka
Copy link
Owner

murka commented Nov 21, 2024

Links:
https://timroughgarden.org/f13/f13.html

  • Lecture 1 (Introduction)
  • Lecture 2 (Mechanism Design Basics)
  • Lecture 3 (Myerson's Lemma)
  • Lecture 4 (Algorithmic Mechanism Design)
  • Lecture 5 (Revenue-Maximizing Auctions)
  • Lecture 6 (Simple Near-Optimal Auctions)
  • Lecture 7 (VCG Mechanism)
  • Lecture 8 (Spectrum Auctions)
  • Lecture 9 (Beyond Quasi-Linearity)
  • Lecture 10 (Kidney Exchange, Stable Matching)
  • Lecture 11 (Selfish Routing and the POA)
  • Lecture 12 (Network Over-Provisioning)
  • Lecture 13 (Hierarchy of Equilibrium Concepts)
  • Lecture 14 (Smooth Games)
  • Lecture 15 (Best-Case and Strong Nash Equilibria)
  • Lecture 16 (Best-Response Dynamics)
  • Lecture 17 (No-Regret Dynamics)
  • Lecture 18 (Swap Regret; Minimax)
  • Lecture 19 (Pure NE and PLS-Completeness)
  • Lecture 20 (Mixed NE and PPAD-Completeness)
@murka murka added the Math label Nov 21, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Math
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@murka