IIT Kharagpur · Computer Science

Algorithmic Game Theory

Prof. Palash Dey · 2024 · 60 free video lectures

Game theory is the formal study of interaction between "self-interested" (or "goal-oriented") "systems" (or "agents" or "decision makers" or "players"), and strategic scenarios that arise in such settings. It began life in Economics in the 1940's with the work of von Neumann and Morgenstern, but…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 1 : Introduction
  2. Lecture 2 : Assumptions of Game Theory
  3. Lecture 3 : Examples of Games
  4. Lecture 4 : Equilibrium Concepts
  5. Lecture 5 : Nash Equilibrium
  6. Lecture 6 : Indifference Principle
  7. Lecture 7 : Security of Players
  8. Lecture 8 : Minmax Theorem
  9. Lecture 9 : Implications of Minmax Theorem
  10. Lecture 10 : MSNEs of Matrix Games
  11. Lecture 11 : Iterative Eliminations of Dominated Strategies
  12. Lecture 12 : Iterative Eliminations of Dominated Strategies (contd..)
  13. Lecture 13 : Braess's paradox
  14. Lecture 14 : Yao's Lemma and its applications
  15. Lecture 15 : Support Enumeration Algorithm
  16. Lecture 16 : Succinct game
  17. Lecture 17 : Potential Games
  18. Lecture 18 : Best Response Dynamics
  19. Lecture 19 : Fast Convergence of Best Response Dynamics
  20. Lecture 20 : Computing ε-PSNE for Network Congestion Games
  21. Lecture 21 : PSNE for Congestion Games
  22. Lecture 22 : PSNE for Symmetric Congestion Games
  23. Lecture 23 : Functional NP
  24. Lecture 24 : PPAD Class
  25. Lecture 25 : Sperner's Lemma
  26. Lecture 26 : Approximate MSNE Computation
  27. Lecture 27 : Correlated Equilibrium
  28. Lecture 28 : Coarse Correlated Equilibrium
  29. Lecture 29 : External Regret Framework
  30. Lecture 30 : Multiplicative Weight Algorithm
  31. Lecture 31 : Multiplicative Weight Algorithm (Contd..)
  32. Lecture 32 : Swap Regret and Correlated Equilibrium
  33. Lecture 33 : Swap Regret to External Regret Reduction
  34. Lecture 34 : Braess's paradox and Pigou's Network
  35. Lecture 35 : PoA of Selfish Routing Game
  36. Lecture 36 : PoA of Selfish Load Balancing Game
  37. Lecture 37 : Bayesian Game
  38. Lecture 38 : BNE of First Price Auction
  39. Lecture 39 : Extensive Form Game
  40. Lecture 40 : Mechanism Design Intro..
  41. Lecture 41 : Implementation of Social Choice Functions
  42. Lecture 42 : Revelation Principle
  43. Lecture 43 : Properties of Social Choice Function
  44. Lecture 44 : Gibbard-Satterthwaite Theorem
  45. Lecture 45 : Quasilinear Environment
  46. Lecture 46 : Ex-Post Efficiency
  47. Lecture 47 : VCG Mechanism
  48. Lecture 48 : Example of VCG Mechanism
  49. Lecture 49 : Weighted VCG
  50. Lecture 50 : Affine Maximizer
  51. Lecture 51 : Recap of Topics Discussed so Far
  52. Lecture 52 : Single Parameter Domain
  53. Lecture 53 : DSIC in Single Parameter Domain
  54. Lecture 54 : Mayerson's Lemma
  55. Lecture 55 : Sponsored Search Auction
  56. Lecture 56 : Intermediate Domain
  57. Lecture 57 : Algorithmic Mechanism Design
  58. Lecture 58 : Stable Matching
  59. Lecture 59 : Gale-Shapley Algorithm
  60. Lecture 60 : Properties of Stable Matching

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kharagpur.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights