In the sequential production game shown below, the actions of four players arerequired in order for a company's project to be successful (for example, each playercould be a different division or department with the company).Player 1Player 2Player 3Player 4ActActActAct101010QuitQuitQuitQuit10-X-X-X-X-X-XSuppose x = 5,000 (payoffs are -5,000). Suppose player 1 believes that Player 4 willquit with probability p. How does this change the game?%3DO a) If 0 < p < 1, Player 1 will actO b) If p > 0.002, Player 1 will quit.O c) If p > 0, Player 1 will quitd) The value of p is irrelevant to Player 1O o o o

In the above sequential game let us use backward induction method to get some idea about the game…

required in order for a company's project to be successful (for example, each player could be a different division or department with the company). Player 1 Player 2 Player 3 Player 4 Act Act Act Act 10 10 10 Quit Quit Quit Quit 10 -X- -X -X

required in order for a company's project to be successful (for example, each player could be a different division or department with the company). Player 1 Player 2 Player 3 Player 4 Act Act Act Act 10 10 10 Quit Quit Quit Quit 10 -X- -X -X

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.7P

See similar textbooks

Similar questions

Game Theory Question A non-profit firm is on a local community online donation platform for a community event it wants to hold (only community members can donate via the website). The event will be held only if the non-profit firm collects $20,000 total from members of the community. Each member values the event at $500. Suppose that there are 100 community members. Community members can only donate by purchasing a lottery ticket from the firm. Each ticket costs $200 and only one ticket can be purchased per member. The proceeds will be collected by the firm. The lottery winner gets a premier meal at a local restaurant that's worth $100. Remember, the firm keeps all the donated money. If the amount of donations is less than $20,000, then the firm returns the donated money to the community members (since there'll be no event held but the lottery winner still gets to eat that fancy meal). If the donations sum up to $20,000, the community event will take place. What are the Nash…
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:…
GAME ZZZ B1 Player B A1 30, 30 Player A A2 20, 40 B2 40, 20 35, 35 In the Game ZZZ (see table above), all payoffs are listed with the row player's payoffs first and the column player's payoffs second. In this game, neither player has a dominant strategy. the Nash equilibrium does not maximize the total payoff. there is no Nash equilibrium. the Nash equilibrium maximizes the total payoff.
3 Alexander the Great (A) is deciding whether to invade Egypt (E) with a big army or a small army. After this, Egypt can decide whether to surrender or fight. If the army is small and they fight, they can defeat the invasion. In this case, Alexander needs to decide whether to negotiate a surrender or die in battle. The game tree with the associated payoffs can be seen below. surrender (10,-10) big army E fight (5,-20) A small army surrender (20,-10) 2 E die fight negotiate (-100, 0) (-50, 50) (a.) What is the Subgame Perfect Nash Equilibrium of the game? Show your work. (b.) Is there another Nash Equilibrium that is not subgame perfect? Explain.
5. The following problem was first considered by John von Neumann and is a fundamentalresult game theory.A and B play the following game:A writes down either number 1 or number 2, and B must guess which one.If the number that A has written down is i and B has guessed correctly, B receives i units from A.If B makes a wrong guess, B pays 4/5 of a unit to A.First we consider the expected gain of player B.Suppose B guesses 1 with probability p and 2 with probability 1 −p.Let X1 denote B’s gain (or loss) in a game where A has written down 1.Let X2 denote B’s gain (or loss) in a game where A has written down 2.(a) Find the pmf of X1 and X2(b) Find B’s expected gain for these two cases, E[X1] and E[X2].(c) What value of p maximizes the minimum possible value of B’s expected gain?Now consider the expected loss of player ASuppose that A writes down 1 with probability q and 2 with probability 1 −q.Let Y1 be A’s loss (or gain) if B chooses number 1.Let Y2 be A’s loss (or gain) if B…
H2. One day, Sam and Ryan play odds/evens to see who gets the last doughnut. On command, they each extend one or two fingers. If the sum is odd Sam wins the doughnut, if the sum is even Ryan wins the doughnut. Suppose the payoff from winning the doughnut is 1 and the payoff from losing is 0. a) Illustrate this interaction as a game in matrix form. b) Suppose that Sam thinks that Ryan will play one finger for sure? What will Sam play? Does Sam have reason to think that Ryan will play one finger for sure? c) Do either of them have a strictly dominated strategy? d) Find the pure strategy Nash equilibria of the game, if any. e) Suppose that Sam thinks that Ryan will play one finger or two fingers with even odds. Will Ryan play one finger for sure, play two fingers for sure or play each strategy with even odds? Does Sam have good reason to believe that Ryan will play one finger or two fingers with even odds?
Game theory Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Player 2 7. Player 1 A B C D -3, -3 0, -11 -4, 3 -11, E 0 -7, -7 -12, 0 (a) Identify any dominated strategies in this game. If there are none, state this clearly. (b) Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly
Game theory Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Player 2 7. Player 1 ہے A B C D -3, -3 0, -11 -4, 3 -11, E 0 -7, -7 -12, 0 (a) Identify any dominated strategies in this game. If there are none, state this clearly. (b) Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.
The next 3 questions involve the following game. There are two players, a husband and wife. They can either be selfish (S) or selfless (U) in their marriage. If they choose to be selfish, then there is a negative ʻguilt’ payoff of g. The payoff matrix is below. Figure 1: The Marriage Game Wife S U S 10-g, 10-g 15-g, 2 U 2, 15-g 12, 12 Number left (right) of comma refers to H's (W's) payoff. 40. Suppose that g = 0. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 41. Suppose that g = 5. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 42. Suppose that g = 10. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). Husband
Write out the extensive form of a game between a farmer (playing in the first round) and nature (playing a mixed strategy in the second round). Assume that the farmer can either pay a cash rent of $1500 for land (English system) or 1/2 of crop production to the landlord (sharecropping). Assume the farmer is planting corn and will produce 2 tons of corn. Assume that nature has a 50% chance of playing a strategy in which the price of corn is $3500/ton and a 50% chance of playing a strategy in which the price of corn is $500/ton. The farmer keeps any money left after paying cash rent and sells any corn left after paying the landlord in sharecropping. What is the most that a risk neutral farmer would be willing to pay for an accurate prediction of the price of corn in problem 1 before choosing whether to pay cash rent or sharecrop?
Consider the following game tree. The players are P1 and P2. The strategies available to P1 are L, M, R. The strategies available to P2 are A and B. P1 L R M P2 (1,10) A В A B (0,0) (2,1) (0,0) (2,1)
6. Two players each pick a positive integer between 1 and 100. If the numbers are identical, noone wins. If the numbers differ by 1, the one with the lower number pays 1 to the opponent. If the difference is at least 2, the one with the higher number pays 2 to the opponent. What is the NE? Hint: Draw a sketch of the game matrix (while you can't consider all 100 strategies, at least consider the lowest 5-6 numbers) and think about dominated strategies.