Lecture Notes on Game Theory
نویسنده
چکیده
1. Extensive form games with perfect information 3 1.1. Chess 3 1.2. Definition of extensive form games with perfect information 4 1.3. The ultimatum game 5 1.4. Equilibria 5 1.5. The centipede game 6 1.6. Subgames and subgame perfect equilibria 6 1.7. Backward induction, Kuhn’s Theorem and a proof of Zermelo’s Theorem 7 2. Strategic form games 10 2.1. Definition 10 2.2. Nash equilibria 10 2.3. Examples 10 2.4. Dominated strategies 13 2.5. Repeated elimination of dominated strategies 13 2.6. Dominant strategies 15 2.7. Mixed equilibria and Nash’s Theorem 15 2.8. Best responses 17 2.9. Correlated equilibria 18 2.10. Zeros-sum games 19 3. Belief and knowledge 23 3.1. Beliefs 23 3.2. Knowledge 26 3.3. Agreeing to disagree 32 3.4. Reaching common knowledge 34 3.5. Bayesian games 35
منابع مشابه
Lecture Notes on Winning Strategies & Regions
This lecture continues the study of hybrid games and their logic, differential game logic [Pla15], that Lecture 20 on Hybrid Systems & Games started. Lecture 20 saw the introduction of differential game logic with a focus on identifying and highlighting the new dynamical aspect of adversarial dynamics. The meaning of hybrid games in differential game logic had been left informal, based on the i...
متن کاملLectures on Frugal Mechanism Design
These lecture notes cover two lectures from EECS 510, Algorithmic Mechanism Design, offered at Northwestern University in the Spring 2008 term. They cover the topic of frugality in mechanism design. Prerequisites for reading these lecture notes are basic understanding of algorithms and complexity as well as elementary calculus and probability theory. I will also assume that the reader has acces...
متن کاملAlgorithms for Computing Solution Concepts in Game Theory
These are notes for the first five lectures of the course on Algorithmic Game Theory, given (starting November 2008) in the Weizmann Institute jointly by Uriel Feige, Robert Krauthgamer and Moni Naor. The lecture notes are not intended to provide a comprehensive view of solution concepts in game theory, but rather discuss some of the algorithmic aspects involved. Hence some of the definitions w...
متن کاملLectures on Optimal Mechanism Design
These lecture notes cover the second third of the class CS364B, Topics in Algorithmic Game Theory, offered at Stanford University in the Fall 2005 term. They cover the topic of optimal mechanism design. As this is a traditional economic objective, we will review the Economics treatment of optimal mechanism design first before moving on to cover recent work on the problem from the theoretical co...
متن کاملComplexity Theory, Game Theory, and Economics
This document collects the lecture notes from my mini-course"Complexity Theory, Game Theory, and Economics,"taught at the Bellairs Research Institute of McGill University, Holetown, Barbados, February 19--23, 2017, as the 29th McGill Invitational Workshop on Computational Complexity. The goal of this mini-course is twofold: (i) to explain how complexity theory has helped illuminate several barr...
متن کامل