Use the following setting for questions 7-8. Players A and B play a dynamic version of matching pennies described below. The game follows in 3 stages. First, player A chooses the order of play, i.e. who makes the first move: player A or player B. This decision is public. Then this chosen (first) player chooses between heads and tails. Then the second (other) player observes that choice and also chooses whether to play heads or tails. For example, player A could choose that player A (themselves) makes the first move; then player A chooses tails; then player B observes it and also chooses tails. Since both of them choose to play tails, their payoffs are 1 and -1 as follows from the payoff matrix below. Player B

Use the following setting for questions 7-8. Players A and B play a dynamic version of matching pennies described below. The game follows in 3 stages. First, player A chooses the order of play, i.e. who makes the first move: player A or player B. This decision is public. Then this chosen (first) player chooses between heads and tails. Then the second (other) player observes that choice and also chooses whether to play heads or tails. For example, player A could choose that player A (themselves) makes the first move; then player A chooses tails; then player B observes it and also chooses tails. Since both of them choose to play tails, their payoffs are 1 and -1 as follows from the payoff matrix below. Player B

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

CLASSES OF GAMES First, Alice chooses either action al or action a2. If Alice chooses action al, then she receives a payoff of 2 and Bob receives a payoff of 8. If Alice chooses action a2, then Bob chooses either action b1 or action b2. If Bob chooses action b1, then Alice receives a payoff of 0 and Bob receives a payoff of 2. If Bob chooses action b2, then Alice receives a payoff of 4 and Bob receives a payoff of 4. Which of the following are correct statements about the game described in the previous paragraph? (Mark all that are correct.) This game has perfect information. The strategy profile (a2,b1) is a Nash equilibrium of this game. Bob's backward induction payoff is 8. The strategy profile (al,b1) is a Nash equilibrium of this game. The strategy profile (a1,b2) is a Nash equilibrium of this game. The strategy profile (a2,b2) is a Nash equilibrium of this game. This is a bargaining game. This is a promise game. This is a threat game. Alice's backward induction payoff is 2.
Samiyah and DeAndre decide to play the following game. They take turns choosing either 1, 2, or 3. As each number is chosen, it is added to the previously chosen numbers. The winner is the player who chooses a number that brings the cumulative number to 10. For example, if Samiyah chooses and DeAndre chooses 2 (so the cumulative number is 5) and Samiyah chooses 2 and DeAndre chooses 3 then DeAndre wins as his choice of 3 results in the sum equaling 10. Using SPNE, who wins?
Player 1 Cooperate (C) Defect (D) If the game has a dominant strategy, what is it? There is none. If the game has a Nash equilibrium in pure strategies, what is it? There is none. Cooperate (C) 3,3 8,0 Cooperate (C) is a dominant strategy for both players. Defect (D) is a dominant strategy for both players. Cooperate (C) is a dominant strategy for 1, and Defect (D) is a dominant strategy for 2. C, C is the only Nash equilibrium. D, D is the only Nash equilibrium. C, C and D, D are both Nash equilibria. Player 2 Defect (D) 0,8 1,1
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.
4. You have probably had the experience of trying to avoid encountering someone, whom we will call Rocky. In this instance, Rocky is trying to find you. It is Saturday night and you are choosing which of two possible parties to attend. You like Party 1 better and, if Rocky goes to the other party, you get a payoff 20 at Party 1. If Rocky attends Party 1, however, you are going to be uncomfortable and get a payoff of 5. Similarly, Party 2 gives you a payoff of 15, unless Rocky attends, in which case the payoff is 0. Rocky likes Party 2 better, but he is likes you. He values Party 2 at 10, Party 1 at 5, and your presence at either party that he attends is worth an additional payoff of 10. You and Rocky both know each others strategy space (which party to attend) and payoffs functions.
Brett and Oliver are both going surfing. Each can choose between "North Beach" (N) and "South Beach" (S). North beach is better, but they both also prefer having the beach to themselves rather than sharing it with the other person. If Brett chooses N and Oliver N, the payoffs are (60, 60). If Brett chooses N and Oliver Chooses S, the payoffs are (70,30). If Brett chooses S and Oliver N the payoffs are (30,70). If they both choose S the payoffs are (20,20). Brett gets to choose first and tells Oliver, who then makes a decision. Which of the following is true? O The number of nash equillibrium in this game is less than the number of subgame perfect equillibrium O The number of nash equillibrium in this game is the same as the number of subgame perfect equillibrium O The number of nash equillibrium in this game is more than the number of subgame perfect equillibrium O There is no subgame perfect equilibrium in this game
Consider the below payoff matrix for a game of chicken. Two players drive their cars down the center of the road directly at each other. Each player chooses SWERVE or STAY. Staying wins you more payoff only if the other player swerves. Swerving loses face if the other player stays. However, the worst outcome is when both players stay. Stay Swerve Stay -0,-0 -6,6 Swerve 6,-6 9,9 Player 1 chooses rows and Player 2 chooses columns. Denote the probability of "Stay" for Player 1 as p and for Player 2 as 9. What is the value of p so that Player 2 is indifferent between Stay and Swerve? Write your answer as a decimal number with 2 decimal places (e.g. 0.05)
(a) Consider a ROCK PAPER SCISSOR game. Two players indicate either Rock, Paper or Scissor simultaneously. The winner is determined by: Rock crushes Scissors, Paper covers Rock, and Scissor cut Paper. In the case of a tie, there is no payoff. In the case of a win, the winner collects 5 dollars. Write the payoff matrix for this game. (b) Find the optimal row and column strategies and the value of the matrix game. 3 2 4 -2 1 -4 5
A small community has 10 people, each of whom has a wealth of $3,000. Each individual must choose whether to contribute $300 or $0 to the support of public entertainment for their community. The money value of the benefit that a person gets from this public entertainment is one half of the total amount of money contributed by all individuals in the community. This game has a Nash equilibrium in which 5 people contribute $300 and for public entertainment and 5 people contribute nothing. This game has a dominant strategy equilibrium in which nobody contributes anything for public entertainment. This game has no Nash equilibrium in pure strategies, but has a Nash equilibrium in mixed strategies. This game has a dominant strategy equilibrium in which all 10 citizens contribute $300 to support public entertainment. This game has two Nash equilibria, one in which everybody contributes $300 and one in which no- body contributes $300.
Which one of the following descriptions is WRONG, according to this Extensive Form shown below? 1.) There are 8 strategy profiles in this game. 2.) If Player 1 chooses strategy IA and Player 2 chooses strategy O, then player 1's payoff will be 4. 3.) If Player 1 chooses strategy OB and Player 2 chooses strategy I, then Player 2's payoff will be 2. 4.) Game over if Player 1 chooses O initially.
Consider the following sequential game. Player 1 plays first, and then Player 2 plays after observing the choice of Player 1 (if necessary). At the bottom of the decision tree, the first number represents the payoff of Player 1, while the second number represents the payoff of Player 2. In equilibrium, the payoff of Player 1 is ✓ and the payoff of player 2 is Player 2 L₂ (-1,8) L₁ Player 1 R₂ (100,1) R₁ (1,0)
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?