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