Game Theory S1 Basic Ideas of Game Theory

Game Theory S-1

Basic Ideas of Game Theory Game theory is the general theory of strategic behavior. Generally depicted in mathematical form. Plays an important role in modern economics. Study of how optimal strategies are formulated in conflict The study of game theory dates back to 1944 when John von Neumann and Oscar Morgenstern published Theory of Games and Economic Behavior In 1994, John Harsanui, John Nash and Reinhard Selten received the Nobel Prize in Economics for developing the notion of noncooperative game theory

Rules, Strategies, Payoffs, and Equilibrium A game is a contest involving two or more decision makers, each of whom wants to win Game theory is the study of how optimal strategies are formulated in conflict A player's payoff is the amount that the player wins or loses in a particular situation in a game. A players has a dominant strategy if that player's best strategy does not depend on what other players do. A two-person game involves two parties (X and Y) A zero-sum game means that the sum of losses for one player must equal the sum of gains for the other. Thus, the overall sum is zero

Rules, Strategies, Payoffs, and Equilibrium Economic situations are treated as games. The rules of the game state who can do what, and when they can do it. A player's strategy is a plan for actions in each possible situation in the game. Strategies taken by others can dramatically affect the outcome of our decisions In the auto industry, the strategies of competitors to introduce certain models with particular features can impact the profitability of other carmakers

Payoff Matrix - Store X Two competitors are planning radio and newspaper advertisements to increase their business. This is the payoff matrix for store X. A negative number means store Y has a positive payoff S-5

Game Outcomes S-6

Minimax Criterion Look to the “cake cutting problem” to explain Cutter – maximize the minimum the Chooser will leave him Chooser – minimize the maximum the Cutter will get Chooser Cutter Choose bigger piece Choose smaller piece Cut cake as evenly as Half the cake minus possible a crumb Half the cake plus a crumb Make one piece Small piece bigger than the other Big piece

Minimax Criterion The game favors competitor X, since all values are positive except one. This means X would get a positive payoff in 3 of the 4 strategies and Y has a positive payoff in only 1 strategy Since Y must play the game (do something about the competition), he will play to minimize total losses using the minimax criterion.

Minimax Criterion For a two-person, zero-sum game, each person chooses the strategy that minimizes the maximum loss or maximize one’s minimum gains Player Y (columns)is looking at a maximum loss of 3 under strategy Y 1 and loss of 5 under Y 2 Y should choose Y 1 which results in a maximum loss of 3 (minimum of 3 and 5) – minimum of the maximums (upper value of the game) The minimum payoffs for X (rows) are +3 (strategy X 1 ) and -5 (strategy X 2) X should choose strategy X 1 – the maximum of the minumums (lower value of the game)

Minimax Criterion If the upper and lower values are the same, the number is called the value of the game and an equilibrium or saddle point condition exists The value of a game is the average or expected game outcome if the game is played an infinite number of times A saddle point indicates that each player has a pure strategy i. e. , the strategy is followed no matter what the opponent does

Saddle Point Von Neumann likened the solution point to the point in the middle of a saddle shaped mountain pass It is, at the same time, the maximum elevation reached by a traveler going through the pass to get to the other side and the minimum elevation encountered by a mountain goat traveling the crest of the range S-11

Pure Strategy - Minimax Criterion Player Y’s Strategies Player X’s strategies Maximum Column Number Minimum Row Number Y 1 Y 2 X 1 10 6 6 X 2 -12 10 6 S-12

Mixed Strategy Game When there is no saddle point, players will play each strategy for a certain percentage of the time The most common way to solve a mixed strategy is to use the expected gain or loss approach A player plays each strategy a particular percentage of the time so that the expected value of the game does not depend upon what the opponent does X 1 Q X 2 1 -Q Y 1 P 4 Y 2 1 -P 2 Expected Gain 1 10 1 P+10(1 -p) 4 Q+1(1 -Q) 2 Q+10(1 -q) 4 P+2(1 -P)

Solving for P & Q 4 P+2(1 -P) = 1 P+10(1 -P) or: P = 8/11 and 1 -p = 3/11 Expected payoff: 1 P+10(1 -P) =1(8/11)+10(3/11) EPX= 3. 46 4 Q+1(1 -Q)=2 Q+10(1 -q) or: Q=9/11 and 1 -Q = 2/11 Expected payoff: EPY=3. 46 S-14

Example Using the solution procedure for a mixed strategy game, solve the following game S-15

Example This game can be solved by setting up the mixed strategy table and developing the appropriate equations: S-16

Example S-17

Nash Equilibrium Occurs when each player's strategy is optimal, given the strategies of the other players. A player's best response (or best strategy) is the strategy that maximizes that player's payoff, given the strategies of other players. A Nash equilibrium is a situation in which each player makes his or her best response. Amy and Phil are in Nash equilibrium if Amy is making the best decision she can, taking into account Phil's decision, and Phil is making the best decision he can, taking into account Amy's decision.

Prisoner's Dilemma Famous example of game theory. Strategies must be undertaken without the full knowledge of what other players will do. Players adopt dominant strategies, but they don't necessarily lead to the best outcome.

Prisoner's Dilemma Two people arrested, but the police do not have enough information for a conviction. The police separate the two and offer both the same deal: If one testifies against the partner and the other remains silent, the betrayer gets 1 year and the one that remains silent gets 8 years. If both remain silent, both are sentenced to 3 years in jail. If each 'rats out' the other, each receives a 4 year sentence. Each prisoner must choose either to betray or remain silent; the decision of each is kept secret from his partner. What should they do?

Prisoner's Dilemma If it is assumed that each player is only concerned with lessening his/her time in jail, the game becomes a nonzero sum game where the two players may either assist or betray the other. The sole concern of the prisoners seems to be increasing their own reward. The interesting symmetry of this problem is that the optimal decision for each is to betray the other, even though they would be better off if they both cooperated.

Prisoner’s Dilemma

Bonnie’s Decision Tree Clyde has a similar decision tree The best strategy for each is to confess even though the better payoff comes from being silent Instead of 3 years each by not confessing, they end up with 4 years each

Dominance A strategy can be eliminated if all its game’s outcomes are the same or worse than the corresponding outcomes of another strategy A strategy for a player is said to be dominated if the player can always do as well or better playing another strategy S-24

Domination Initial Game X 1 X 2 X 3 Y 1 4 2 1 Revised Game Y 2 3 20 1 X 2 Y 1 4 2 Y 2 3 20 X 3 is a dominated strategy as player X can always do better with X 1 or X 2 S-25

Domination Initial Game Y 1 Y 2 Y 3 Y 4 X 1 -5 4 6 -3 X 2 -2 6 2 -20 Game after dominated strategies are removed for player Y Y 1 Y 4 X 1 -5 -3 X 2 -2 -20 S-26