Explain the concept of two-person zero- sum game and saddle point. Also provide a suitable example. Determine which of the following two-person zero-sum games are strictly determinable and fair. Give the optimum strategies for each player in the case of it being strictly determinable. Player A Player B B2 вз 4 B1 A1 5 -1 2 A2

Explain the concept of two-person zero- sum game and saddle point. Also provide a suitable example. Determine which of the following two-person zero-sum games are strictly determinable and fair. Give the optimum strategies for each player in the case of it being strictly determinable. Player A Player B B2 вз 4 B1 A1 5 -1 2 A2

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter15: Strategic Games

Section: Chapter Questions

Problem 3MC

See similar textbooks

Similar questions

a) Find the Nash equilibria in the game (in pure and mixed strategies) and the associated payoffs for the players. b) Now assume that the game is extended in the following way: in the beginning Player 1 can decide whether to opt out (this choice is denoted by O) or whether to play the simultaneous-move game in a) (this choice is denoted by G). If Player 1 opts out (plays O) then both Player 1 and Player 2 get a payoff of 4 each and the game ends. If Player 1 decides to play G, then the simultaneous-move game is played. Find the pure-strategy Nash equilibria in this extended version of the game. (Hint: note that Player 1 now has 4 strategies and write the game up in a 4x2 matrix.) c) Write the game in (b) up in extensive form (a game tree). Identify the subgames of this game.
Consider the extensive form game portrayed below. The top number at aterminal node is player 1’s payoff, the middle number is player 2’s payoff,and the bottom number is player 3’s payoff.a. Derive the strategy set for each player. (Note: If you do not want to listall of the strategies, you can provide a general description of a player’sstrategy, give an example, and state how many strategies are in thestrategy set.)b. Derive all subgame perfect Nash equilibria. c. Derive a Nash equilibrium that is not a SPNE, and explain why it isnot a SPNE.
(a) Find all the Nash Equilibria, if there is any. (no explanation needed for this part (b) Does player 1 (choosing rows) have any dominant action? If yes, which action(s)? Any dominated action(s)? If yes, which ones? Answer the same questions for player 2, too. (c) If player 1 moves first (and player 2 moves next), what would be the sequentially rational equilibrium (draw the game tree and use backward induction)?What if player 2 moves first (and then player 1 moves next)? (d) Looking at your findings in (c), would player 1 want to move first or second or is she indifferent (the order doesn’t matter)?
Solve for the Nash equilibrium (or equilibria) in each of the following games. (a) The following two-by-two game is a little harder to solve since firm 2’spreferred strategy depends of what firm 1 does. But firm 1 has a dominantstrategy so this game has one Nash equilibrium. Firm 2 Launch Don’tFirm 1 Launch 60, -10 100, 0 Don’t 80, 30 120, 0 What is the Nash equilibrium of this simultaneous-move game? (b) What would the outcome of this game be if instead firm 1 moved first and then, after seeing what firm 1 chose, firm 2 chose it strategy? In this case firm 1 doesn’t necessarily need to choose a best response, but firm 2 must choose a best response since it moves second.
Paramter y = 0 If ⟨a, d⟩ is played in the first period and ⟨b, e⟩ is played in the second period, whatis the resulting (repeated game) payoff for the row player?
(a) What are the sets of pure strategies of players A and B?(b) Find the subgame perfect equilibrium(c) Provide a brief argument why the SPE is unique (i.e., why there are no more SPE, whether in pure or mixed strategies).
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
on 8.1 Consider the following game: Player 1 A C D 7,6 5,8 0,0 Player 2 E 5,8 7,6 1, 1 F 0,0 1,1 4,4 a. Find the pure-strategy Nash equilibria (if any). b. Find the mixed-strategy Nash equilibrium in which each player randomizes over just the first two actions. c. Compute players' expected payoffs in the equilibria found in parts (a) and (b). d. Draw the extensive form for this game.
Indicate whether the following statement is TRUE or FALSE and explain your answer: If one player is the leader in a game it means that s/he has the first move in the game. The key thing is that this move can be observed by the follower before making his/her own decision, otherwise it would be a simultaneous move game that cannot be solved by backwards induction
A) Focus on the strategic game at the lower-right side of the gametree. Find all the Nash equilibria for this subgame, including the mixed-strategyones. (b) Find all the subgame perfect equilibria for the entire game, allowingfor both pure and mixed strategies
Consider a two-player, sequential-move game where each player can choose to play right or left. Player 1 moves first. Player 2 observes player 1’s actual move and then decides to move right or left. If player 1 moves right, player 1 receives $0 and player 2 receives $25. If both players move left, player 1 receives –$5 and player 2 receives $10. If player 1 moves left and player 2 moves right, player 1 receives $20 and player 2 receives $20. a. Write this game in extensive form. b. Find the Nash equilibrium outcomes to this game. c. Which of the equilibrium outcomes is most reasonable? Explain.
John enjoys playing two-player zero-sum games. The matrix below shows the losses to John in a particular two-player zero-sum game. His strategies are denoted by I, II, and III, whereas the strategies for his opponent are denoted by A, B, and C. I II III A 3 2 4 B 0 1 1 C 1 3 0 (a) Explain which of John’s strategies is dominated.The opponent now has the option of a fourth strategy, D, which results in none ofJohn’s strategies being dominated.(b) Suggest possible values for the strategy D.