Each player simultaneously chooses a number from {1, 2,..., 10} and writes it down on a piece of paper; then the players compare the two numbers. If the numbers differ by one, the player with the higher number pays the other player £2. If the players' choices differ by two, the player with the lower number pays £1 to the other player. If the numbers differ by 3 or more then the player with the highest number pays £2 to the other player. In the event of a tie, no money changes hands. Construct a game matrix which describes this game, and evaluate what each player's optimum strategies would be.

Each player simultaneously chooses a number from {1, 2,..., 10} and writes it down on a piece of paper; then the players compare the two numbers. If the numbers differ by one, the player with the higher number pays the other player £2. If the players' choices differ by two, the player with the lower number pays £1 to the other player. If the numbers differ by 3 or more then the player with the highest number pays £2 to the other player. In the event of a tie, no money changes hands. Construct a game matrix which describes this game, and evaluate what each player's optimum strategies would be.

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

. In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. a. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. b. Is there a pure strategy? Why or why not? c. Determine the optimal strategies and the value of this game. Does the game favor one player over the other? d. Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.
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…
What is Ann's maximin strategy? Game Bob L RAnn U 10,-1 4, 4 D 4, 1 8, -1 Select one: a.none of the other answers b.4/7 U + 3/7 D c.2/5 U+ 3/5 D d.2/7 U + 5/7 D e.3/5 U + 2/5 D
Two workers are on a production line. They each have two actions: exert effort, E, or shirk, S. Effort costs a worker e > 0 and shirking costs them nothing. If two workers do action E a lot of output is produced and the workers earn £3 each. If only one worker chooses action E less output is produced and they both earn £1. The workers earn nothing if they both shirk. (i) Describe this situation as a strategic form game (assuming the workers do not observe each other's effort choice when making their own decision). (ii) For what values of e does this game have strictly dominant strategies? (iii) Describe the Nash equilibria of this game for e = 0,1, 2, 3. (iv) The workers now are re-arranged into a production line. First worker 1 moves and then worker 2 moves. Worker 2 can now see worker l's effort level before they choose their effort. Draw this extensive form game. (v) Find the subgame perfect equilibria of the production-line game for c = 1/2 and c = 3/2.
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
$11. Anne and Bruce would like to rent a movie, but they can't decide what kind of movie to get: Anne wants to rent a comedy, and Bruce wants to watch a drama. They decide to choose randomly by playing "Evens or Odds." On the count of three, each of them shows one or two fingers. If the sum is even, Anne wins and they rent the comedy; if the sum is odd, Bruce wins and they rent the drama. Each of them earns a payoff of 1 for winning and 0 for losing "Evens or Odds." (a) Draw the game table for "Evens or Odds." (b) Demonstrate that this game has no Nash equilibrium in pure strategies.
2 Consider Anna and Joe, who value a certain good by the same amount v and can choose to either contribute (C) e to get the good or not (N) where v > e> 0. Obtaining the good only requires c from one person. The game is summarized in the payoff table below: Joe V-c,V-c V-c,V v,V-c 0,0 Find a pure strategy equilibrium and a mixed strategy equilibrium. Anna O Z
Hi this is from a textbook. Thank you. Consider the following game in which Sally can play T or B and John chooses between L or R. Each player makes their choice simultaneously. If Sally chooses T and John chooses L, Sally gets a payoff of 5 and John has a payoff of 4. If Sally plays T and John R, Sally’s payoff is 8 and John gets 3. If Sally Chooses B and John L, the payoffs are 3 to Sally and 2 to John. Finally, if Sally chooses B and John R, the payoffs are 7 to Sally and 0 to John. Which statement is true? a) The Nash equilibrium is (B,R); this is a prisoners’ dilemma b) The Nash equilibrium is (T,R); this is a prisoners’ dilemma c) The Nash equilibrium is (T,R); this is not dominant strategy equilibrium d) The Nash equilibrium is (T,L); this is a dominant strategy equilibrium e) None of the above
Question 5 ave Answer Player 1 has two options: L and R. If Player 1 chooses L, then Player 2 has two options; she can choose A or B. If Player 2 chooses A payoffs are (2; 1) and if she chooses B payoffs are (1; 2). If Player 1 chooses R, then Player 2 has two options; she can choose Y or N. If Player 2 shows Y payoffs are (0; 3) and if she chooses N payoffs are (1; 2). Which of the following statements is true? O A. (L; B,Y ) is a subgame perfect equilibrium of this game O B. (R; B,N ) is a subgame perfect equilibrium of this game O C.(L; A,Y) is a subgame perfect equilibrium of this game O D. (R; B,Y ) is a subgame perfect equilibrium of this game
Which of the following is NOT an example of a coordination game? O deciding whether to grow tomatoes or flowers coordination with customers O deciding whether to use the same technology as others you are connected to interpersonal relationships
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.
Question 4. Zeynep and Mehmet will eventually play the following game. Mehmet L R U 3,1 0,0 Zeynep D 0,3 1,3 In a preliminary stage, Zeynep has already asked Mehmet to allow her to move first and proposed to pay him 1 unit of her own payoff in exchange. So Mehmet has to options: • If he accepts Zeynep's offer: they will play the sequential move version of the above game in which Zeynep moves first. Mehmet will receive 1 unit of utility more, and Zeynep will receive 1 unit of utility less (in any outcome of the game) compared to the payoffs given in the bimatrix. 2 • If he rejects Zeynep's offer: they will play the simultaneous move game. a. Represent this strategic interaction in a game tree. b. How many information sets does each player have? c. Characterize the set of pure strategies for both players. d. Present this game as a normal-form game, and characterize the set of pure strategy Nash equi- libria.