Book contents
- Frontmatter
- Contents
- Preface
- 1 Theory 1: Introduction
- 2 Theory 2: Simultaneous Games
- 3 Example: Selecting a Class
- 4 Example: Doctor Location Games
- 5 Example: Restaurant Location Games
- 6 Using Excel
- 7 Example: Election I
- 8 Theory 3: Sequential Games I: Perfect Information and no Randomness
- 9 Example: Dividing A Few Items I
- 10 Example: Shubik Auction I
- 11 Example: Sequential Doctor and Restaurant Location
- 12 Theory 4: Probability
- 13 France 1654
- 14 Example: DMA Soccer I
- 15 Example: Dividing A Few Items II
- 16 Theory 5: Sequential Games with Randomness
- 17 Example: Sequential Quiz Show I
- 18 Las Vegas 1962
- 19 Example: Mini Blackjack and Card Counting
- 20 Example: Duel
- 21 Santa Monica in the 50s
- 22 Theory 6: Extensive Form of General Games
- 23 Example: Shubik Auction II
- 24 Theory 7: Normal Form and Strategies
- 25 Example: VNM POKER and KUHN POKER
- 26 Example: Waiting for Mr. Perfect
- 27 Theory 8: Mixed Strategies
- 28 Princeton in 1950
- 29 Example: Airport Shuttle
- 30 Example: Election II
- 31 Example: VNM POKER(2, r, m, n)
- 32 Theory 9: Behavioral Strategies
- 33 Example: Multiple-Round Chicken
- 34 Example: DMA Soccer II
- 35 Example: Sequential Quiz Show II
- 36 Example: VNM POKER(4, 4, 3, 5)
- 37 Example: KUHN POKER(3, 4, 2, 3)
- 38 Example: End-of-Semester Poker Tournament
- 39 Stockholm 1994
- Bibliography
- Index
2 - Theory 2: Simultaneous Games
- Frontmatter
- Contents
- Preface
- 1 Theory 1: Introduction
- 2 Theory 2: Simultaneous Games
- 3 Example: Selecting a Class
- 4 Example: Doctor Location Games
- 5 Example: Restaurant Location Games
- 6 Using Excel
- 7 Example: Election I
- 8 Theory 3: Sequential Games I: Perfect Information and no Randomness
- 9 Example: Dividing A Few Items I
- 10 Example: Shubik Auction I
- 11 Example: Sequential Doctor and Restaurant Location
- 12 Theory 4: Probability
- 13 France 1654
- 14 Example: DMA Soccer I
- 15 Example: Dividing A Few Items II
- 16 Theory 5: Sequential Games with Randomness
- 17 Example: Sequential Quiz Show I
- 18 Las Vegas 1962
- 19 Example: Mini Blackjack and Card Counting
- 20 Example: Duel
- 21 Santa Monica in the 50s
- 22 Theory 6: Extensive Form of General Games
- 23 Example: Shubik Auction II
- 24 Theory 7: Normal Form and Strategies
- 25 Example: VNM POKER and KUHN POKER
- 26 Example: Waiting for Mr. Perfect
- 27 Theory 8: Mixed Strategies
- 28 Princeton in 1950
- 29 Example: Airport Shuttle
- 30 Example: Election II
- 31 Example: VNM POKER(2, r, m, n)
- 32 Theory 9: Behavioral Strategies
- 33 Example: Multiple-Round Chicken
- 34 Example: DMA Soccer II
- 35 Example: Sequential Quiz Show II
- 36 Example: VNM POKER(4, 4, 3, 5)
- 37 Example: KUHN POKER(3, 4, 2, 3)
- 38 Example: End-of-Semester Poker Tournament
- 39 Stockholm 1994
- Bibliography
- Index
Summary
In his story “Jewish Poker” the writer Ephraim Kishon describes how a man called Ervinke convinces the narrator to play a game called Jewish Poker with him. “You think of a number, I also think of a number”, Ervinke explains. “Whoever thinks of a higher number wins. This sounds easy, but it has a hundred pitfalls.” Then they play. It takes the narrator some time until he realizes that it is better to let Ervinke tell his number first. [K1961] Obviously this is a game that is not fair unless both players play simultaneously.
In this chapter we will start our journey through game theory by considering games where each player moves only once, and moves are made simultaneously. The games can be described in a table (called the game's normal form). Then we discuss approaches that allow the players to decide which move they will choose, culminating with the famous Nash equilibrium.
Normal Form—Bimatrix Description
Imagine you want to describe a simultaneous game. We know that each player has only one move, and that all moves are made simultaneously. What else do we need to say? First, we must stipulate the number of players in the game. Second, we must list for each player all possible moves. Different players may have different roles and may have different options for moves. We assume that each player has only finitely many options. Players simultaneously make their moves, determine the outcome of the game, and receive their payoffs. We need to describe the payoffs for each outcome.
- Type
- Chapter
- Information
- Game Theory Through Examples , pp. 4 - 18Publisher: Mathematical Association of AmericaPrint publication year: 2014