Let there be two players in a game, Player 1 and Player 2. Consider a jar containing 5 snakes. 3 of the snakes in the jar are venomous, while the remaining 2 are non-venomous In the game, both the players have to put their hand in the jar one after the other and pick a snake out. Each snake, if picked out of the jar, will bite the player's hand. The event of picking a venomous snake, or equivalently, a venomous snake's bite will earn the player zero points. On the other hand, the event of picking a non-venomous snake, or equivalently, a non-venomous snake's bite will earn the player one point. Let X denote Player 1's pick and let y denote Player 2's pick. Suppose Player 1 is the first to pick out a snake. The expected value of Player 1's pick is: E(X)= (Express your answer as a fraction or round your answer to two decimal places)

Let there be two players in a game, Player 1 and Player 2. Consider a jar containing 5 snakes. 3 of the snakes in the jar are venomous, while the remaining 2 are non-venomous In the game, both the players have to put their hand in the jar one after the other and pick a snake out. Each snake, if picked out of the jar, will bite the player's hand. The event of picking a venomous snake, or equivalently, a venomous snake's bite will earn the player zero points. On the other hand, the event of picking a non-venomous snake, or equivalently, a non-venomous snake's bite will earn the player one point. Let X denote Player 1's pick and let y denote Player 2's pick. Suppose Player 1 is the first to pick out a snake. The expected value of Player 1's pick is: E(X)= (Express your answer as a fraction or round your answer to two decimal places)

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

Only typed answer
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?
2. Consider two players playing a simultaneous moves game. These players can be one of the two states of the world, state 1 or state 2, while playing the game. The payoffs-matrix for the two state games are as follows: State 1 P1 U D P2 L R 1,4 1,0 1,6 2,16 0,0 0,24 M State 2 P1 U D P2 L M R 1,0 1,4 1,6 2,16 0,24 0,0 Each players believes that the two states are equally likely, Derive the BNE of the game.
When you are with a young child and want to show them something fun and new, there is the risk that, if they enjoy it, they'll ask for it over and over and over again, and if you ever say no they'll throw a fit, which you will then have to deal with. Consider the following game: First, you decide whether to show them an Old thing again, or a New thing. If you show them the Old thing, you get 2 points and the kid gets 2 points Then, If you showed them the New thing, the kid chooses whether to Ask for it to happen again, or Not Ask. If they choose Not Ask, you get 3 points and the kid gets 3 points If they choose to Ask, you can choose to say Yes, in which case you get 1 point and the kid gets 4 points, or No, in which case they throw a fit, and you get 0 points and the kid gets 2 points Draw the game tree for this game.
2
Consider the following game played by four individuals, players 1, 2, 3, and 4. Each individual has $10,000. Each player can donate between $0 and $10,000 to build a public park that costs $20,000. If they collect enough money, they construct the park, which is worth $9,000 to each of them. However, if they collect less than $20,000, they cannot build a park. Furthermore, regardless of whether the park is built or not, individuals lose any donations that they make. a) Describe the Nash equilibria for a simultaneous game. What makes them equilibria? Hint: There are many equilibria, so you may want to use a mathematical expression! b) Suppose that players 1, 2, and 3, each donate $4,000 for the park. How much will player 4 donate and why. What are the resulting payoffs for the players? c) Suppose instead that player 1 donated first, player 2 second, player 3 third, and player 4 last. Furthermore, players could only donate in intervals of 1,000 (0, $1,000, $2,000, etc.). How much will…
Consider the following game. You will roll a fair, 6-sided die either once or twice. You decide whether to do the second roll after you see how the first one lands. The payoff is $n, where n is the outcome of the last roll. For example, if the first roll lands 4 and the second lands 2, you win $2. If you only do one roll and it lands 4, you win $4. Suppose you make your decision about whether to go for a second roll based on expected monetary value. Then you will go for a second roll if (and only if) the first roll lands x or lower. What is x?
Use the following payoff matrix for a simultaneous-move one-shot game to answer the accompanying questions. Strategy A Player 1 B Player 2 C D E F 19, 4 9, 15 7, 18 11, 13 8, 10 17, 7 12, 15 4, 9 a. What is player 1's optimal strategy? Strategy B Player 1 does not have an optimal strategy. Strategy A b. Determine player 1's equilibrium payoff. 8 *
3:51 9 M 23 The mixed strategy Nash equilibrium of the following * game is Player 2 R. L Player 1 U 2,2 3,1 D 3.-1 0.0 U with 3/4 probability and D with 1/4 probability for player 1; L with1/2 probability and probability for player 2 with 1/2 U with 1/2 probability and D with 1/2 probability for player 1; L with1/4 probability and R with 3/4 probability for player 2 U with 1/4 probability and D with 3/4 probability for player 1; L with1/2 probability and R with 1/2 probability for player 2 O None of the above. U with 1/2 probability and D with 1/2 probability for player 1; L with3/4 probability and R with 1/4 probability for player 2
4. Consider a two player game with Fred and Barney, who tal turns removing matchsticks from a pile. They start with 33 matchsticks, and Fred goes first. On each turn, ecach player may remove either one, two, three, four, or five matchsticks. The player to remove the last matchstick wins the game. What are the optimal strategies for each player? Who will win? b. Suppose now that they can remove up to six matchsticks, how will the optimal strategies change for- each player? a.
3.Students A and B decide whether to clean the dormitory. Regardless of whether the other party participates, the cleaning cost for each student to clean the dormitory is $ 8; and the benefit for each student from cleaning is $5 times the number of participants. (hint: if both of them clean the dormitory together, A and B benefit. If one cleans while the other does not, A and B benefit too) (a) Please use a game theory to briefly describe the above scenario, (that is to calculate the revenue for different strategies) (b) Draw the payoff matrix, find the Nash equilibrium.