(Demand Game) Two players can divide ten dollars. Find the Nash equilibria of the following two games. (a) The players simultaneously submit demands, numbers in {0, 1,...,10). If the sum of the demands is at most 10, each player gets what she demands. Otherwise both get 0. (b) As in the previous part, except that if the sum of the demands exceeds 10, then (i) if the demands differ then the player who demands less gets her demand and the other player gets the rest, and (ii) if the demands are the same then each player gets 5. (Hint- write the best response functions).

(Demand Game) Two players can divide ten dollars. Find the Nash equilibria of the following two games. (a) The players simultaneously submit demands, numbers in {0, 1,...,10). If the sum of the demands is at most 10, each player gets what she demands. Otherwise both get 0. (b) As in the previous part, except that if the sum of the demands exceeds 10, then (i) if the demands differ then the player who demands less gets her demand and the other player gets the rest, and (ii) if the demands are the same then each player gets 5. (Hint- write the best response functions).

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

Answer all questions otherwise don't solve it.
Consider the following simultaneous move game where player 1 has two types. Player 2 does not know if he is playing with type a player 1 or type b player 1. Find the all the possible Bayesian Nash Equilibriums (BNE) of this game.
If the players play pure strategies, the game has no Nash equilibrium. But what if they choose their moves randomly? Let each player instead opt for a mixed strategy instead of a pure strategy. The first will play action Z with probability p, and the second will play action L with probability q. At which pair (p, q) are the mixed strategies of the players in equilibrium? At which pair (p, q) does neither player want to change strategy? When are both strategies simultaneously the best response?
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 again the normal form of the Prisoner's dilemma game. Determine any Nash Equilibrium. Player 2 R (-10,-10) (-1,-25) (-25,-1) (-3,-3) C Player 1 R
Jane is interested in buying a car from a used car dealer. Her maximum willingness to pay for thecar is 12 ($12,000). Bo, the dealer, is willing to sell the car as long as he receives at least 9($9,000). What is the Nash bargaining solution to this game?
Mr. and Mrs. Ward typically vote oppositely in elections and so their votes “cancel each other out.” They each gain two units of utility from a vote for their positions (and lose two units of utility from a vote against their positions). However, the bother of actually voting costs each one unit of utility. Diagram a game in which they choose whether to vote or not to vote.
Problem 2. Consider the partnership-game we discussed in Lecture 3 (pages 81-87 of the textbook). Now change the setup of the game so that player 1 chooses x = [0, 4], and after observing the choice of x, player 2 chooses y ≤ [0, 4]. The payoffs are the same as before. (a) Find all SPNE (subgame perfect Nash equilibria) in pure strategies. (b) Can you find a Nash equilibrium, with player 1 choosing x = 1, that is not subgame perfect? Explain.
Suppose that, in an ultimatum game, the proposer may not propose less than $1 nor fractional amounts, and therefore must propose $1, $2, …, or $10 (see image attached below). The responder must Accept (A) or Reject (R). Suppose, first, that this game is played by two egoists, for whom u(x,y)=x. Find all subgame-perfect equilibria in this game. Suppose, second, that this game is played by two altruists, for whom u(x,y) = ⅔(x)1/2 + ⅓(y)1/2. Find all subgame-perfect equilibria in this game.
Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.
Use the following payoff matrix for a one-shot game to answer the accompanying questions. Player 2 Strategy X Y Player 1 A 30, 30 16, -50 B -50, 16 50, 50 A. Determine the Nash equilibrium outcomes that arise if the players make decisions independently, simultaneously, and without any communication. check all that apply (16, −50) (−50, 16) (30, 30) (50, 50) Which of these outcomes would you consider most likely? multiple choice (16, −50) (50, 50) (−50, 16) (30, 30) B. Suppose player 1 is permitted to “communicate” by uttering one syllable before the players simultaneously and independently make their decisions. What should player 1 utter? multiple choice A or B What outcome do you think would occur as a result? multiple choice (−50, 16) (16, −50) (30, 30) (50, 50) c. Suppose player 2 can choose its strategy before player 1, that player 1 observes player 2’s choice before making her decision, and that this move structure is…