an auditor and a taxpayer play the following strategic game. The auditor must choose hether to Audit (A) the taxpayer or not (N). The taxpayer independently decides whether o be Honest (H) in reporting her income or to Cheat (C). Since auditing is costly, the uditor prefers not to audit the taxpayer if she reports honestly, but prefers to audit if the axpayer cheats. If the taxpayer is caught cheating (i.e. if she cheats and is audited), then he receives a severe punishment. If she is not caught, she prefers cheating to being honest. uppose that payoffs are as in the following matrix: Auditor Taxpayer C H A 2,0 4,-10 N 4,0 0,4 (a) Find all (mixed strategy) Nash equilibria of this game.

an auditor and a taxpayer play the following strategic game. The auditor must choose hether to Audit (A) the taxpayer or not (N). The taxpayer independently decides whether o be Honest (H) in reporting her income or to Cheat (C). Since auditing is costly, the uditor prefers not to audit the taxpayer if she reports honestly, but prefers to audit if the axpayer cheats. If the taxpayer is caught cheating (i.e. if she cheats and is audited), then he receives a severe punishment. If she is not caught, she prefers cheating to being honest. uppose that payoffs are as in the following matrix: Auditor Taxpayer C H A 2,0 4,-10 N 4,0 0,4 (a) Find all (mixed strategy) Nash equilibria of this game.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

We’ll now show how a college degree can get you a better job even if itdoesn’t make you a better worker. Consider a two-player game between aprospective employee, whom we’ll refer to as the applicant, and an employer. The applicant’s type is her intellect, which may be low, moderate,or high, with probability 1/3 , 1/2 , and 1/6 , respectively. After the applicantlearns her type, she decides whether or not to go to college. The personalcost in gaining a college degree is higher when the applicant is less intelligent, because a less smart student has to work harder if she is to graduate. Assume that the cost of gaining a college degree is 2, 4, and 6 for an applicant who is of high, moderate, and low intelligence, respectively.The employer decides whether to offer the applicant a job as a manageror as a clerk. The applicant’s payoff to being hired as a manager is 15,while the payoff to being a clerk is 10. These payoffs are independent ofthe applicant’s type. The employer’s payoff from…
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 following variation to the Rock (R), Paper (P), Scissors (S) game:• Suppose that the Player 1 (row player) has a single type, Normal.• Player 2 (column player) has two types Normal and Simple.• A player of Normal type plays this zero-sum game as we studied in class whereas a player of type Simple always play P.• Player 2 knows whether he is Normal or Simple, but player 1does not.a) Suppose player 2 is of type Normal with probability 1/3 and of type Simple with probability (2/3). Find all pure strategy Bayesian Nash Equilibria.b) Suppose player 2 is of type Normal with probability 2/3 and of type Simple with probability (1/3). Find all pure strategy Bayesian Nash Equilibria.
Someone at a party pulls out a $100 bill and announces that he is going to auction it off. There are n=10 people at the partywho are potential bidders. The owner of the $100 bill puts forth the following procedure: All bidders simultaneously submit a written bid. Only the highest bidders pay their bid (assuming that the highest bid is positive). If m people submit the highest bid, then each receives 1/m of the $100. Each person’s strategy set is {0,1,2,...,1000}{0,1,2,...,1000} so bidding can go as high as $1,000. The payoff of a player bidding bi is:0 if bi < max{b1,b2,…,bn},and 100/m − bi if bi = max {b1,b2,…,bn}where,m is the number of bidders whose bid equals max{b1,...,bn}. How many pure-strategy Nash equilibria does this game have? 1) 0 2) 1 3) 4 4) More than 4.
Consider the game of Chicken in which each player has the option to “get out of the way” and “hang tough” with payoffs: Get out of the way Hang tough Get out of the way 2,2 1,3 Hang tough 3,1 00 a. Find all pure strategy Nash equilibria, if they exist b. Let k be the probability that player 1 chooses “hang tough” and u be the probability that player two chooses “hang tough.” Find the mixed stragety Nash equilibria, if they exist
A game is played as follows: First Player 1 decides (Y or N) whether or not to play.If she chooses N, the game ends. If she chooses Y, then Player 2 decides (Y or N) whetheror not to play. If he chooses N the game ends. If he chooses Y, then they go ahead and playanother game with the payoffs shown below. A player who opts out by choosing N gets 2 andthe other player gets 0. Draw the tree of this game and then find the two subgame-perfect Nashequilibria.
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 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.
Mohamed and Kate each pick an integer number between 1 and 3 (inclusive). They make their choices sequentially.Mohamed is the first player and Kate the second player. If they pick the same number each receives a payoff equal to the number they named. If they pick a different number, they get nothing. What is the SPE of the game? a. Mohamed chooses 3 and Kate is indifferent between 1, 2 and 3. b. Mohamed chooses 3 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2, and 3 if Mohamed chooses 3. c. Mohamed chooses 1 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2 and 3 if Mohamed chooses 3. d. Mohamed chooses 3 and Kate chooses 3.
Let us see the example of Juan and María given but modify their preferences. It is still the case that they are competitive and are deciding whether to show up at their mom’s house at 8:00 A.M., 9:00 A.M., 10:00 A.M., or 11:00 A.M. But now they don’t mind waking up early. Assume that the payoff is 1 if he or she shows up before the other sibling, it is 0 if he or she shows up after the other sibling, and it is 1 if they show up at the same time. The time of the morning does not matter. Find all Nash equilibria.
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)
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?