Finu all ue purt"3truto5Ja fair mechanism for allocating cookies? Explain why or why not.U13. (Optional) Construct the payoff matrix for your own two-player gamethat satisfies the following requirements. First, each player should havethree strategies. Second, the game should not have any dominant strat-egies. Third, the game should not be solvable using minimax. Fourth.should have exactly two pure-strategy Nash equilibria. Provideyour game matrix, and then demonstrate that all of the above conditionsthegameare true.

Given information 2 players Each player has 3 strategy There should not be saddle point solution

(Optional) Construct the payoff matrix for your that satisfies the following requirements. First, e= three strategies. Second, the game should not ha egies. Third, the game should not be solvable u the game should have exactly two pure-strategy your game matrix, and then demonstrate that all are true.

(Optional) Construct the payoff matrix for your that satisfies the following requirements. First, e= three strategies. Second, the game should not ha egies. Third, the game should not be solvable u the game should have exactly two pure-strategy your game matrix, and then demonstrate that all are true.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

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 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)
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.
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.
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?
For the operating systems game, let us now assume the intrinsic superiorityof Mac is not as great and that network effects are stronger for Windows.These modifications are reflected in different payoffs. Now, the payoff fromadopting Windows is 50 X w and from adopting Mac is 15 + 5 X m;n consumers are simultaneously deciding between Windows and Mac.a. Find all Nash equilibria.b. With these new payoffs, let us now suppose that a third option exists,which is to not buy either operating system; it has a payoff of 1,000.Consumers simultaneously decide among Windows, Mac, and nooperating system. Find all Nash equilibria.
See the extensive form game image attached. 1) Solve the game by backward induction 2) Find all the pure-strategy Nash equilibria (in complete contingent plans)of the extensive-form game (no need to write down thenormal-form representation)
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.
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.
Consider the following two-player game.First, player 1 selects a number x≥0. Player 2 observes x. Then, simultaneously andindependently, player 1 selects a number y1 and player 2 selects a number y2, at which pointthe game ends.Player 1’s payoff is: u1(x; y1) = −3y21 + 6y1y2 −13x2 + 8xPlayer 2’s payoff is: u2(y2) = 6y1y2 −6y22 + 12xy2Draw the game tree of this game and identify its Subgame Perfect Nash Equilibrium.
please discuss the separation eqilibrium in details 1. Assume that two players play the Tinder game. There are two types of potential boyfriends: the gentleman (25% of the population) and the douchebag (75% of the population), and they can decide on the different level of effort: low, medium, and high. For the first type, the respective costs are 30, 50, and 80. For the second type, the respective costs are 50, 75, and 120. For the potential boyfriend, the payoff from being in relationship is 130, and the payoff associated with being dumped is 70. The girl can get 60 if she stays single, 100 if she is in relationship with the gentleman, and 25 if she dates the douchebag (credits to Owen Sims) a) Present the game in the extensive form b) Calculate the expected pay-off for the girl. Should she date at all? c) Discuss whether the game has a separating equilibrium
4. Correlated EquilibriaConstruct an example (not one from class or the reading) of a Normal form game with a correlated equilibrium that is not a Nash equilibrium.