Tom and Jerry are contestants on Jeopardy. Tom is leading with an accumulation of $12000, while Jerry trails closely at $10000. In the final segment of the show, contestants must wager an amount not exceeding their current accumulation that they will answer the last question of the night correctly. Wagers are made before the question is revealed. If the contestant answers correctly, they have their wager added to their accumulation. Otherwise, it is deducted. Jerry is a game show master and expects to answer correctly with 90% certainty. Tom is less experienced and only has a 55% chance. Their utilities of wealth are given by u™ (x) = xỉ and u' (x) = 50xi 3 a) How much should Tom wager to maximise his expected utility? b) How much should Jerry wager to maximise his expected utility? c) In expectation, how much money the expected winner of the show is going to win?

Tom and Jerry are contestants on Jeopardy. Tom is leading with an accumulation of $12000, while Jerry trails closely at $10000. In the final segment of the show, contestants must wager an amount not exceeding their current accumulation that they will answer the last question of the night correctly. Wagers are made before the question is revealed. If the contestant answers correctly, they have their wager added to their accumulation. Otherwise, it is deducted. Jerry is a game show master and expects to answer correctly with 90% certainty. Tom is less experienced and only has a 55% chance. Their utilities of wealth are given by u™ (x) = xỉ and u' (x) = 50xi 3 a) How much should Tom wager to maximise his expected utility? b) How much should Jerry wager to maximise his expected utility? c) In expectation, how much money the expected winner of the show is going to win?

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

Consider the following sequential bargaining game. Two players, A and B, have a total of $240,000 to divide between them. A makes an offer first, then B agrees or makes a counter offer and so on. Delay in reaching an agreement is very costly in that during the time between two offers the 'pot' shrinks by 50%. There are at most 4 rounds, i.e. if A rejects B's second offer, both players get zero. (a) Draw the game tree. (b) Find the subgame perfect equilibrium.
8
Three politicians are voting on whether to allow themselves a salary increase of$3,500per a year. If they vote in favor of a raise, then they lose some public support, costing them each$1,500 per year. The salary increase passes if two or more politicians vote in favor of it. What is this game’s Nash equilibrium (or equilibria)? Explain. There is no need to draw a payoff matrix.
Only typed answer
Question D2. An Aggressor country is threatening to attack another victim country. The victim country has allies who will come to their defence if they are attacked, however, the amount of troops the ally sends can be either small or large. The victim knows how many troops will be sent but the aggressor does not, the aggressor believes the probability the force is large is p. The game faced by the countries is depicted below. Victim "Large force" Defend Capitulate Aggressor Attack (-50,-20) (100,-50) Don't Attack (0,-10) (0,0) Victim "Small force" Defend Capitulate Aggressor Attack (50,-80) (100,-50) Don't Attack (0,-10) (0,0) a) Define what it means for a game to have incomplete information and explain how a game with unknown payoffs can be thought of as such a game. b) Write down a combined payoff matrix that includes strategies for the victim that are conditional on their type and use this to work out the Bayesian-Nash Equilibria for this game.
None
Question 28 Consider the following Extended Form Game: 01 O 5 O 3 A 09 (2,3) P1 A' (5,5) A' B (3,8) A P2 B' P2 B' (1,9) Player 1 always plays B. Player 2 chooses the strategy (B', B'). What is the payoff of player 1? P1 B (9,1)
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?
Consider the following game. Firm 1 can implement one of two actions, A or B. Firm 2 observes the action chosen by Firm 1 and then decides whether to fight it or not. (-10, 20) F2 Fight A Don't fight -(30, 10) Firm 1 (-10, 0) Fight B Don't fight -(20, 15) (a) Consider the following strategy profile: Firm 1 chooses A; Firm 2 chooses fight if A, and fight if B. • this strategy profile is [Select] (b) Consider the following strategy profile: Firm 1 chooses B; Firm 2 chooses fight if A, and don't fight if B. • this strategy profile is [Select] O (c) Consider the following strategy profile: Firm 1 chooses B; Firm 2 chooses don't fight if A and don't fight if B. • this strategy profile is [Select] 00 F2 ()
In this version of the ultimatum game experiment, one participant is given £100, and is told to offer to split that amount with another participant. The second player can either refuse to accept the division, in which case the participant receiving the £100 has to give it back, or can accept the division, in which case, the player receiving the money splits the £100 as proposed. For the participant who has to accept or reject the offer A) The best strategy is to accept any offer which meets the social norm for fairness. B) The best strategy is to threaten to turn down any transfer of less than £100 to ensure that the person receiving the money makes a fair offer. C) There is a dominant strategy to accept any offer because gaining some money is better than gaining no money D) There is a dominant strategy to turn down any offer other than £50 because an unequal split would be unfair.
The owner of the Jets is going to offer a contract to a free agent player, Hapoleon. If signed, Hapoleon can give the Jets high effort or low effort. High effort costs Hapoleon $2 million and low effort costs Hapoleon nothing. The Jets’ owner cannot observe Hapoleon’s effort directly. Hapoleon has a guaranteed offer of $10 million from another team, the Sharks. If Hapoleon signs with the Jets, the team can be profitable or not and the Jets’ owner can observe that. If Hapoleon gives high effort, then the probability the Jets are profitable is 80 percent, but if Hapoleon gives low effort, then the probability the Jets are profitable is 40 percent. Hapoleon is the typical risk neutral player and his utility is given by u w() = w . Calculate the optimal wage levels, wH and wL , that the Jets’ owner should offer Hapoleon to get him to sign with the Jets and give high effort if Hapoleon’s disutility from high effort increases to $3 million. Determine the optimal wage levels, wH and wL ,…
BET GAME Each player puts an ante of $1 into the pot. There are four kings and four queens. The professor will randomly draw a card from the dealer, privately observe what it is, and decide whether to fold or to bet.< a) If the professor folds, the game ends, and you wins the pot, gaining the professor's $1 ante.< b) If the professor bets, another dollar will be placed in the pot, after which you has the option to either fold or call.< b-1) if you fold, the game is end and you lose you $1 ante.< b-2) if you call, you need to add another $1 to the pot and the professor need to reveal the card. At this stage, there will be $4 in the pot. You win the pot with a queen and lose the pot with a king.< (1) Draw the Game Tree.< (2) Write down the Payoff Matrix. (3) Find the Bayesian Nash Equilibrium (4) Find the Perfect Bayesian Nash Equilibrium.<