IIT Bombay · Computer Science

Introduction to Game Theory and Mechanism Design

Dr. Swaprava Nath · 62 free video lectures

62 video lectures. Topics: Introduction: Game Theory; Introduction: Mechanism Design; The game of chess; Proof of the chess theorem; Normal form games; Dominance; Nash equilibrium; Maxmin strategies; Elimination of dominated strategies; Preservation of PSNE; Matrix games; Relation between Maxmin…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Module 1 : Introduction: Game Theory
  2. Module 2: Introduction: Mechanism Design
  3. Module 3: The game of chess
  4. Module 4: Proof of the chess theorem
  5. Module 5: Normal form games
  6. Module 6: Dominance
  7. Module 7: Nash equilibrium
  8. Module 8: Maxmin strategies
  9. Module 9: Elimination of dominated strategies
  10. Module 10: Preservation of PSNE
  11. Module 11: Matrix games
  12. Module 12: Relation between Maxmin and PSNE in matrix
  13. Module 13: Mixed strategies
  14. Module 14: Mixed strategy Nash equilibrium (MSNE)
  15. Module 15: Find MSNE
  16. Module 16: MSNE characterization theorem proof
  17. Module 17: Algorithm to find MSNE
  18. Module 18: Correlated equilibrium (CE)
  19. Module 19: Computing correlated equilibrium
  20. Module 20: Extensive form games
  21. Module 21: Subgame perfection
  22. Module 22: Limitations of SPNE
  23. Module 23 : Imperfect Information Extensive Form Games (IIEFG)
  24. Module 24 : Strategies in IIEFGs
  25. Module 25 : Equivalence of Strategies in IIEFGs
  26. Module 26: Perfect Recall
  27. Module 27: Equilibrium in IIEFG
  28. Module 28: Game Theory in Practice: P2P file sharing
  29. Module 29: Bayesian Games
  30. Module 30: Strategy, Utility in Bayesian Games
  31. Module 31: Equilibrium in Bayesian Games
  32. Module 32: Examples of Bayesian Equilibrium
  33. Module 33: Introduction to Mechanism Design
  34. Module 34: Revelation Principle
  35. Module 35: Introduction to Arrow's Impossibility Result
  36. Module 36: Proof of Arrow's Result
  37. Module 37: Introduction to the Social Choice Setup
  38. Module 38: Introduction to Gibbard-Satterthwaite Theorem
  39. Module 39: Proof of Gibbard-Satterthwaite Theorem
  40. Module 40: Domain Restriction
  41. Module 41: Median Voting Rule
  42. Module 42: Median Voter Theorem - Part 1
  43. Module 43: Median Voter Theorem - Part 2
  44. Module 44: The Task Sharing Domain
  45. Module 45: The Uniform Rule
  46. Module 46: Mechanism Design with Transfers
  47. Module 47: Examples of Quasi-linear Preferences
  48. Module 48: Pareto Optimality and Groves Payments
  49. Module 49: Introduction to VCG Mechanism
  50. Module 50: VCG in Combinatorial Allocations
  51. Module 51: Applications to Internet Advertising
  52. Module 52: Slot Allocation and Payments in Position
  53. Module 53: Pros and Cons of VCG Mechanism
  54. Module 54: Affine Maximizers
  55. Module 55: Single Object Allocation
  56. Module 56: Myerson's Lemma
  57. Module 57: Illustration of Myerson's Lemma
  58. Module 58: Optimal Mechanism Design
  59. Module 59: Single Agent Optimal Mechanism Design
  60. Module 60: Multiple Agent Optimal Mechanism Design
  61. Module 61: Examples of Optimal Mechanisms
  62. Module 62: Endnotes and Summary

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

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