4. Suppose that there is a negotiation between two players over a painting. Person 1, the seller, has no interest in the painting. On the other hand the painting is worth $100 to the buyer. If the painting is sold at a price in between 0 and 100, both are better off. Player 1 proposes a price p to player 2. Then, after observing player 1's offer, player 2 decides whether to accept it or to reject it. If the offer is rejected both get zero and the game ends. Find the unique SPNE of this game.

4. Suppose that there is a negotiation between two players over a painting. Person 1, the seller, has no interest in the painting. On the other hand the painting is worth $100 to the buyer. If the painting is sold at a price in between 0 and 100, both are better off. Player 1 proposes a price p to player 2. Then, after observing player 1's offer, player 2 decides whether to accept it or to reject it. If the offer is rejected both get zero and the game ends. Find the unique SPNE of this game.

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

We have a group of three friends: Kramer, Jerry and Elaine. Kramer has a $10 banknote that he will auction off, and Jerry and Elaine will be bidding for it. Jerry and Elaine have to submit their bids to Kramer privately, both at the same time. We assume that both Jerry and Elaine only have $2 that day, and the available strategies to each one of them are to bid either$0, $1 or $2. Whoever places the highest bid, wins the $10 banknote. In case of a tie (that is, if Jerry and Elaine submit the same bid), each one of them gets $5. Regardless of who wins the auction, each bidder has to pay to Kramer whatever he or she bid. Does Jerry have any strictly dominant strategy? Does Elaine?
Not multiple questions
5
5
Give step by step answer with final answer
M5
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?
6
2
3. Two individuals are involved in a synergistic relationship. If both individuals devote more effort to the relationship, they are both better off. Specifically, an effort level is a nonnegative number, and player 1's payoff function is e₁(1+€₂-e₁), where ei is player i's effort level. For player 2 the cost of effort is either the same as that of player 1, and hence her payoff function is given by e2(1+e₁ - e₂), or effort is very costly for her in which case her payoff function is given by e₂(1 + e₁ — 2e2). 1 Player 2 knows player 1's payoff function and whether the cost of effort is high for herself or not. Player 1, however, is uncertain about player 2's cost of effort. He believes that the cost of effort is low with probability p, and high with probability 1 - p, where 0 < p < 1. Find the Bayesian Nash equilibrium of this game as a function of p.
In a three stage alternating offers bargaining game, player 1 demands a fraction x of $100. If this is accepted by player 2, the $100 is split between the players with outcome ($100x,$100(1 - x)). Otherwise, at stage 2, player 2 makes a demand for a fraction y. If this is accepted by player 1, the $100 is divided accordingly but otherwise player 1 can make another offer and demand a fraction z. If that offer is rejected by player 2, the outcome is (0,0). Both players have a discount factor of 1/2. (a) Find a perfect equilibrium for this game. (b) Is there a first-mover advantage?
2. Consider the following "centipede game." The game starts with player 1 choosing be- tween terminate (T) and continue (C). If player 1 chooses C, the game proceeds with player 2 choosing between terminate (t) and continue (c). The two players choose be- tween terminate and continue in turn if the other player chooses continue until the terminal nodes with (player l's payoff, player 2's payoff) are reached as shown below. TTTT Player 1 Player 2 Player 1 Player 2 (3, 3) t (1, 1) (0, 3) (2, 2) (1, 4) (a) List all possible strategies of each player. (b) Transform the game tree into a normal-form matrix representation. (c) Find all pure-strategy Nash equilibria. (d) Find the unique pure-strategy subgame-perfect equilibrium.