Game Theory En

Original English notes from CS4 Algorithmic Game Theory and Applications at the University of Edinburgh.

---

Table of contents

• Lecture 2 Mixed Strategies, Expected Payoffs, and Nash Equilibrium
• Lecture 3 Nash’s Theorem
• Lecture 4 Zero-sum games, and the Minimax Theorem
• Lecture 5 Introduction to Linear Programming
• Lecture 6 The Simplex Algorithm
• Lecture 7 LP Duality
• Lecture 8 Computing Solutions for General Finite Strategic Games, Part I
• Lecture 9 Computing Solutions for General Strategic Games, Part II
• Lecture 10 Games in Extensive Form
• Lecture 11 Games of Perfect Information
• Lecture 12 Games on Graphs
• Lecture 15 A brief taster of Markov Decision Processes and Stochastic Games
• Lecture 16 Selfish Network Routing, Congestion Games, and the Price of Anarchy
• Lecture 17 A first look at Auctions and Mechanism Design
• Lecture 18 Auctions and Mechanism Design II
• Lecture 19 Auctions and Mechanism Design III