6 The accompanyıng figure presents Informaticnone-shot gameFirm BPriceHigh Price(20), -(12)(18), (18)Firm ALow Price(5), (15)(12), (-20)High PriceIf this one-shot game is repeated 10 times, the Nash equilibrium payoffs of the players will bein each period.Multiple Choice(12, 20)(18, 18)(15, 15)(20, 12)

The Nash equilibrium is the best strategy opted for by the player by thinking about the action of…

The accompanyıng figure presents Informaticn one-shot game Firm B Price High Price (20), -(12) Firm A Low Price (5), (15) (12), (-20) High Price (18), (18) If this one-shot game is repeated 10 times, the Nash equilibrium payoffs of the players will be in each period Multiple Choice (12, 20) (18, 18) (15, 15) (20, 12)

The accompanyıng figure presents Informaticn one-shot game Firm B Price High Price (20), -(12) Firm A Low Price (5), (15) (12), (-20) High Price (18), (18) If this one-shot game is repeated 10 times, the Nash equilibrium payoffs of the players will be in each period Multiple Choice (12, 20) (18, 18) (15, 15) (20, 12)

Managerial Economics: Applications, Strategies and Tactics (MindTap Course List)

14th Edition

ISBN:9781305506381

Author:James R. McGuigan, R. Charles Moyer, Frederick H.deB. Harris

Publisher:James R. McGuigan, R. Charles Moyer, Frederick H.deB. Harris

Chapter13: best-practice Tactics: Game Theory

Section: Chapter Questions

Problem 10E

See similar textbooks

Similar questions

Consider the game with the payoffs below. Which of the possible outcomes are MORE efficient than the Nash Equilibrium (NE)? Note, they do NOT need to be Nash equilibria themselves, they just need to be more efficient than the NE. Multiple answers are possible, but not necessary. You need to check ALL correct answers for full credit. JILL High Medium LowMAGGIE Left 3,4 2,3 2,2Center 4,8 9,7 8,7Right 7,6 8,5 9,4Group of answer choices (Left, Low) There is no strategy combination that is more efficient than the Nash equilibrium for this game. (Right, Medium) (Left, High) (Center, Medium) (Center, High) (Center, Low) (Left, Medium) (Right, Low) (Right, High)
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.
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
There are three players who must each choose an “effort” level from 1 to 7, that is, Si = {1, 2, 3, ..., 7}. The payoff for each player i is ui(si, s−i) = 10 max{s1, s2, s3} − si. How many pure- strategy Nash equilibria are there? Select one: a.2 b.4 c.none of the other answers d.3 e.1
Paramter y = 0 What is the highest payoff any player can receive in any subgame perfect Nashequilibrium of the repeated game?
E3 Bayesian Game]. Consider a Bayesian game described by a following payoff matrix. Please solve (show your solution). 1. Enumerate all pure strategies for each player. 2. Suppose that player 1 observes his type ?1 = 3. How does player 1 think of the probability of ?2? 3. Find a (pure strategy) Bayesian Nash equilibrium.
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 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 strategic form game shown. a. Assume that both players are rational. What happens?b. Assume that both players are rational and that each believes that theother is rational. What happens?c. Find the strategies that survive the ISDS.
Consider the following coordination game: Player 2P1 Comedy Show Concert Comedy Show 11,5 0,0 Concert 0,0 2,2 a. Find the Nash equilibrium(s) for this game.b. Now assume Player 1 and Player 2 have distributional preferences. Specifically, both people greatly care about the utility of the other person. In fact, they place equal weight on their outcome and the other person’soutcome, ρ = σ = ½. Find the Nash equilibrium(s) with these utilitarianpreferences.c. Now consider the case where Player1 and Player2 do not like each other. Specifically, any positive outcome for the other person is viewed as anegative outcome for the individual, ρ = σ = -1. Find the Nashequilibrium(s) with these envious preferences.
Consider Bernard \ Mary Left Center Right Top 0,5 1,0 2,2 Bottom 1,0 0,3 2,2 The first number in a cell denotes the payoff to Bernard and the second number denotes the payoff to MaryForexample: πB(B,L)=1and πM(T,L)=5. a Give all pure strategy Nash equilibria of this one-shot game, if any. Briefly explain.Let Bernard play Top with probability p and Bottom with probability 1 − p; let Mary play Left with probability qL , Center with probability qC and Right with probability qR = 1 − qL − qC . b Give all mixed strategy Nash equilibria of this game.
Find all NE of the stage game.(b) Consider a two-period game without discounting in which the stage game is played ineach period. Find all pure strategy SPNE.(c) What’s the min-max payoff of each player?(c1) Consider pure strategies only.(c2) Consider all strategies, including the mixed ones.(d) Now suppose the stage game is repeated infinitely many times. Use the Fudenberg-Maskin Folk theorem to find all possible values of payoff that can be supported as aSPNE.