###
MA 440-001

Game Theory

Mathematics

### Material on Test 1

Test 1 is Monday Oct. 1. It will cover chapters 1 to 3 in the online notes.

Things you should be able to do:

- From a description of a situation, write an extensive form game (1.16.1(2), 3.11.11(1)).
- Analyze an extensive form game by backward induction; find threats and promises (1.16.1, 1.16.2, 1.16.3).
- Analyze a continuous game in which players move successively by backward induction (1.16.6, 1.16.7).
- For a game in normal form, identify weakly dominated and strictly dominated strategies (2.14.2, 2.13.4(1)-(3)).
- Do iterated elimination of dominated strategies in normal form games (2.14.3, 2.14.4(4)-(6), 2.14.6, 2.14.7, 3.11.7(1)-(5), 3.11.8(1)).
- Express a situation in game theory terms by identifying the players, strategies, and payoffs, and find Nash equilibria by examining all strategy profiles (3.11.3, 3.11.6, 3.11.10, 3.11.12, 1.16.6 redo).
- Write an extensive form game in normal form (3.11.11(2)).
- Find Nash equilibria using the best response correspondence (3.11.7(6), 3.11.8(2), 3.11.11(3)).

MA 440-001 home page

Test study guides

Instructor's home page
NC State home page

Last modified Wed Sep 19 2011

Send questions or comments to schecter@math.ncsu.edu