Download presentation

Presentation is loading. Please wait.

Published byAldo Godkin Modified over 2 years ago

1
Game Theory, Part 1 Game theory applies to more than just games. Corporations use it to influence business decisions, and militaries use it to guide their strategies. In fact, game theory grew in popularity and acceptance during WWII.

2
Game Theory, Part 1 In essence, the goal of game theory is to determine the best strategy for a participant in any sort of competition to use.

3
Game Theory, Part 1 How do we determine the best strategy for each competitor? Begin with constructing a payoff matrix.

4
Game Theory, Part 1 How do we determine the best strategy for each competitor? Begin with constructing a payoff matrix. The payoff matrix shows the outcome for each possible combination of strategies by each competitor.

5
Game Theory, Part 1 We will consider only competitions that are limited to two participants. The rows of the payoff matrix will represent the actions of one competitor, the columns will represent the options for the other competitor.

6
Game Theory, Part 1 Very important: The values in the payoff matrix represent the payoff for the row competitor.

7
Game Theory, Part 1 Very important: The values in the payoff matrix represent the payoff for the row competitor. Those values represent exactly the opposite payoff for the column competitor.

8
Game Theory, Part 1 Example: Sol and Tina play a game where they each choose to display either heads or tails on a coin. They reveal their coins at the same time, and have the following payoff matrix. H T Tina H T Sol

9
Game Theory, Part 1 Remember that the values in the matrix show the payoff for Sol. H T H T Tina Sol If Sol and Tina each play heads, Sol wins 3 pennies. This means, of course, that Tina loses 3 pennies.

10
Game Theory, Part 1 Remember that the values in the matrix show the payoff for Sol. H T H T Tina Sol If Sol plays heads and Tina plays tails, then Sol loses 1 penny; Tina gains 1 penny—exactly opposite of Sol.

11
Game Theory, Part 1 Remember that the values in the matrix show the payoff for Sol. H T H T Tina Sol What strategy should each player follow?

12
Game Theory, Part 1 One method of choosing a strategy is to try to minimize the potential damage or loss. In other words, choose the least of all evils.

13
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol For Sol, look at the rows. If Sol plays heads, the possible outcomes are to win 3 pennies, or to lose 1 penny.

14
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol If Sol plays heads, the worst that can happen is that he will lose 1 penny. This is the row minimum for row 1.

15
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol In order to minimize Sol’s losses, he should choose the maximum value of all the row minimums. -2

16
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol This value is called the maximin—the maximum of the row minimums—which in this case is –1. -2

17
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol Now consider Tina. Remember that the values in the payoff matrix are exactly the opposite for her. In other words, large positive numbers mean she loses money. -2

18
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol Because of this, we find the worst-case scenario for her by searching for the largest numbers in each column. 3 -2

19
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol If Tina plays heads, the worst thing that can happen is that she’ll lose 3 pennies, as opposed to possibly winning 1 penny. 3 -2

20
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol If she plays tails, the worst thing that can happen is that she’ll win 1 penny, rather than 2. 3 -2

21
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol In order to minimize her losses, we want to choose the minimum of the column maximums, called the minimax. 3 -2

22
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol Notice that Sol’s maximin is the same as Tina’s minimax. This suggests that the outcome of the game will be the same every time—Tina will win 1 penny. 3 -2

23
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol This is an example of a strictly determined game, where the maximin and the minimax are the same. 3 -2

24
Game Theory, Part 1 Consider the worst-case scenario for each player, for each option. H T H T Tina Sol That value for the maximin and minimax is called the saddle point of the game. It shows the outcome each game for the row player. 3 -2

25
Game Theory, Part 1 Consider another game where each player displays a card with the letter A, B, C, or D. This game has the following payoff matrix: A B C D A B C D Sol Tina

26
Game Theory, Part 1 A B C D A B C D Sol Tina Sol took a close look at his options, represented in the rows, and noticed something interesting.

27
Game Theory, Part 1 A B C D A B C D Sol Tina Regardless of what Tina does, row A never provides a better outcome for Sol than row D.

28
Game Theory, Part 1 A B C D A B C D Sol Tina Row D is said to dominate row A. Because it can never outdo row D, Sol can simply eliminate A as an option.

29
Game Theory, Part 1 A B C D A B C D Sol Tina Likewise, Tina can compare her options in the columns of the payoff matrix. Remember, though, that she wants the smallest (most negative) numbers, as those represent more money won.

30
Game Theory, Part 1 A B C D A B C D Sol Tina Column C always outperforms column A, regardless of what Sol does. So Tina can eliminate column A.

31
Game Theory, Part 1 A B C D A B C D Sol Tina Now that Sol and Tina have both eliminated A as an option, we really only need to worry about a 3x3 payoff matrix. Evaluate the maximin and minimax.

32
Game Theory, Part 1 A B C D A B C D Sol Tina The maximin is –2, which occurs for strategy D. -3 -5 -2

33
Game Theory, Part 1 A B C D A B C D Sol Tina This suggests that Sol should play D, and Tina should play D. In such an event, Sol will win 2 pennies. -3 -5 -2 342

34
Game Theory, Part 1 A B C D A B C D Sol Tina How long do you think Tina will play this game? -3 -5 -2 342

Similar presentations

OK

UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.

UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Greenhouse effect for kids ppt on batteries Ppt on zener diode polarity Ppt on machine translation quality Differential display ppt on ipad Ppt online open enrollment Ppt on young uncle comes to town Free ppt on american war of independence Ppt on history of olympics in greece Ppt on multi junction solar cell Download ppt on recession in india