There are two players, A and B. When A and B meet, each can decide to fight (F) or cave (C). Fighting is costly. It requires resources. If both choose to fight, fight occurs and each gets A gets , - c while B gets H who caves gets 0. In case both decide not to fight, i.e. both choose cave (C) each gets . - c. If only one, A or B, chooses to fight, then the one who chooses to fight gets 1 while the one

There are two players, A and B. When A and B meet, each can decide to fight (F) or cave (C). Fighting is costly. It requires resources. If both choose to fight, fight occurs and each gets A gets , - c while B gets H who caves gets 0. In case both decide not to fight, i.e. both choose cave (C) each gets . - c. If only one, A or B, chooses to fight, then the one who chooses to fight gets 1 while the one

Microeconomics: Principles & Policy

14th Edition

ISBN:9781337794992

Author:William J. Baumol, Alan S. Blinder, John L. Solow

Publisher:William J. Baumol, Alan S. Blinder, John L. Solow

Chapter13: Between Competition And Monopoly

Section: Chapter Questions

Problem 10DQ

See similar textbooks

Similar questions

Please no written by hand Two players bargain over how to split $10. Each player i ∈ {1, 2} choose a number si ∈ [0, 10] (which does not need to be an integer). Each player’s payoff is the money he receives. We consider two allocation rules. In each case, if s1 + s2 ≤ 10, each player gets his chosen amount si and the rest is destroyed. 1. In the first case, if s1 + s2 > 10, both players get zero. What are the (pure strategy) Nash equilibria? 2. In the second case, if s1 + s2 > 10 and s1 6= s2, the player who chose the smallest amount receives this amount and the other gets the rest. If s1 + s2 > 10 and s1 = s2, they both get $5. What are the (pure strategy) Nash equilibria? 3. Now suppose that s1 and s2 must be integers. Does this change the (pure strategy) Nash equilibria in either case?
Keith and Blake play a simultaneous one-shot game. Keith chooses between Top and Bottom, whereas Blake chooses between left and right. Payoffs are given by (Keith's payoffs are listed first and Blake's payoffs second): Top+left: 3,-6. Top+right:0,-7 Bottom+left:4,0. Bottom+right:-2,6. In a mixed strategy equilibria, Keith will play Top with what probability? 1. 6/7 2. 1/4 3. 1/2 4. 1/7 5. 0 6. 3/4
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
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.
Game Theory Consider the entry game with incomplete information studied in class. An incumbent politician's cost of campaigning can be high or low and the entrant does not know this cost (but the incumbent does). In class, we found two pure-strategy Bayesian Nash Equilibria in this game. Assume that the probability that the cost of campaigning is high is a parameter p, 0 < p < 1. Show that when p is large enough, there is only one pure-strategy Bayesian Nash Equilibrium. What is it? What is the intuition? How large does p have to be? Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
Two farmers have unlimited access to a common plot of land and can let their cows graze on it. The matrix below shows the benefits they get from grazing either 1 or 2+ cows on the land. Farmer 2 Farmer1 1 cow 2+ cows 1 cow 8,8 2,10 2+cows 10,2 4,4 What kind of game is this? What is/are the Nash equilibrium/equilibria? What is/are the Pareto efficient outcome(s) in this game? (Hint: Remember that Pareto efficiency occurs when no one person can be made better off without someone else being made worse off) The government offers a reward or subsidy for communities where farmers only allow 1 cow to graze on the common field, resulting in a new payoff matrix:…
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?
Alice and Betsy are playing a game in which each can play either of two strategies, leave or stay. If both play the strategy leave, then each gets a payoff of $400. If both play the strategy stay, then each gets a payoff of $800. If one plays stay and the other plays leave, then the one who plays stay gets a payoff of $C and the one who plays leave gets a payoff of $D. When is the outcome where both play leave a Nash equilibrium? a) never, since 800 > 400 b) when 400 > C and D > 800 but not when 800 > D c) whenever 400 > C d) when D > C and C > 400 e) whenever d < 800
There are a kicker and a goalie who confront each other in a penalty kick that willdetermine the outcome of the game. The kicker can kick the ball left or right, while the goaliecan choose to jump left or right. Because of the speed of the kick, the decisions need to bemade simultaneously. If the goalie jumps in the same direction as the kick, then the goalie winsand the kicker loses. If the goalie jumps in the opposite direction of the kick then the kickerwins and the goalie loses. Model this as a strategic form game and write down the matrix thatrepresents the game you modeled. Find the Nash equilibrium.
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.
Consider the following game. There are two payers, Player 1 and Player 2. Player 1 chooses a row (10, 20, or 30), and Player 2 chooses a column (10/20/30). Payoffs are in the cells of the table, with those on the left going to Player 1 and those on the right going to player 2. For example, a payoff 100/200 would mean Player 1 receives 100 and Player 2 receives 200.What is [are] the Nash Equilibrium [Equilibria] of this game?A) (10/10) and (20/20)B) (30/30)C) (10/20) and (20/10)D) (20/20)E) (30/30)
A occurs if all players in a game play their best strategies given what their competitors do.