Modules / Lectures
Module NameDownload
Week_01_Assignment_01Week_01_Assignment_01
Week_02_Assignment_02Week_02_Assignment_02
Week_03_Assignment_03Week_03_Assignment_03
Week_04_Assignment_04Week_04_Assignment_04
Week_05_Assignment_05Week_05_Assignment_05
Week_06_Assignment_06Week_06_Assignment_06
Week_07_Assignment_07Week_07_Assignment_07
Week_08_Assignment_08Week_08_Assignment_08


Sl.No Chapter Name MP4 Download Transcript Download
1Lecture 1 : Combinatorial Games: Introduction and examplesDownloadDownload
Verified
2Lecture 2 : Combinatorial Games: N and P positionsDownloadDownload
Verified
3Lecture 3 : Combinatorial Games: Zermelo’s TheoremDownloadDownload
Verified
4Lecture 4 : Combinatorial Games: The game of HexDownloadDownload
Verified
5Lecture 5 : Combinatorial Games: Nim gamesDownloadDownload
Verified
6Lecture 6: Combinatorial Games: Sprague-Grundy Theorem - IDownloadDownload
Verified
7Lecture 7: Combinatorial Games: Sprague-Grundy Theorem - IIDownloadDownload
Verified
8Lecture 8: Combinatorial Games: Sprague-Grundy Theorem - IIIDownloadDownload
Verified
9Lecture 9: Combinatorial Games: The Sylver Coinage GameDownloadDownload
Verified
10Lecture 10: Zero-Sum Games: Introduction and examplesDownloadDownload
Verified
11Lecture 11 : Zero-Sum Games: Saddle Point Equilibria & the Minimax TheoremDownloadDownload
Verified
12Lecture 12 : Zero-Sum Games: Mixed StrategiesDownloadDownload
Verified
13Lecture 13 : Zero-Sum Games: Existence of Saddle Point EquilibriaDownloadDownload
Verified
14Lecture 14 : Zero-Sum Games: Proof of the Minimax TheoremDownloadDownload
Verified
15Lecture 15 : Zero-Sum Games: Properties of Saddle Point EquilibriaDownloadDownload
Verified
16Lecture 16 : Zero-Sum Games: Computing Saddle Point EquilibriaDownloadDownload
Verified
17Lecture 17 : Zero-Sum Games: Matrix Game PropertiesDownloadDownload
Verified
18Lecture 18 : Non-Zero-Sum Games: Introduction and ExamplesDownloadDownload
Verified
19Lecture 19 : Non-Zero-Sum Games: Existence of Nash Equilibrium Part IDownloadDownload
Verified
20Lecture 20 : Non-Zero-Sum Games: Existence of Nash Equilibrium Part IIDownloadDownload
Verified
21Lecture 21 : Iterated elimination of strictly dominated strategiesDownloadDownload
Verified
22Lecture 22 : Lemke-Howson Algorithm IDownloadDownload
Verified
23Lecture 23 : Lemke-Howson Algorithm IIDownloadDownload
Verified
24Lecture 24 : Lemke-Howson Algorithm IIIDownloadDownload
Verified
25Lecture 25 : Evolutionary Stable Strategies -IDownloadDownload
Verified
26Lecture 26 : Evolutionarily Stable Strategies - IIDownloadDownload
Verified
27Lecture 27 : Evolutionarily Stable Strategies - IIIDownloadDownload
Verified
28Lecture 28 : Fictitious PlayDownloadDownload
Verified
29Lecture 29 : Brown-Von Neumann-Nash DynamicsDownloadDownload
Verified
30Lecture 30 : Potential GamesDownloadDownload
Verified
31Lecture 31 : Cooperative Games: Correlated EquilibriaDownloadDownload
Verified
32Lecture 32 : Cooperative Games: The Nash Bargaining Problem IDownloadDownload
Verified
33Lecture 33 : Cooperative Games: The Nash Bargaining Problem IIDownloadDownload
Verified
34Lecture 34 : Cooperative Games: The Nash Bargaining Problem III DownloadDownload
Verified
35Lecture 35 : Cooperative Games: Transferable Utility GamesDownloadDownload
Verified
36Lecture 36 : Cooperative Games: The CoreDownloadDownload
Verified
37Lecture 37 : Cooperative Games: Characterization of Games with non-empty CoreDownloadDownload
Verified
38Lecture 38 : Cooperative Games: Shapley ValueDownloadDownload
Verified
39Lecture 39 : Cooperative Games: The NucleolusDownloadDownload
Verified
40Lecture 40 : The Matching ProblemDownloadDownload
Verified