Two friends, Albert (A) and Berta (B), have to decide on going to one- of three bars, Xenia's (X), Yara's (Y), or Zana's (Z). They decide to select a bar by alternatively vetoing bars until one remains. First Albert vetoes a bar. If at least two bars remain, then Berta vetoes another bar. That process continues until a single bar remains unvetoed. Suppose Albert prefers Xenia's to Yara's to Zana's and Berta prefers Zana's to Yara's to Xenia's. Assume that, for each of the two, going to their most preferred bar gives a utility of 2, going to their next preferred bar gives a utility of 1, and going to their least preferred bar gives a utility of 0. Model this as an extensive form game and find its Nash equilibria. Which of the Nash equilibria are subgame perfect?

Two friends, Albert (A) and Berta (B), have to decide on going to one- of three bars, Xenia's (X), Yara's (Y), or Zana's (Z). They decide to select a bar by alternatively vetoing bars until one remains. First Albert vetoes a bar. If at least two bars remain, then Berta vetoes another bar. That process continues until a single bar remains unvetoed. Suppose Albert prefers Xenia's to Yara's to Zana's and Berta prefers Zana's to Yara's to Xenia's. Assume that, for each of the two, going to their most preferred bar gives a utility of 2, going to their next preferred bar gives a utility of 1, and going to their least preferred bar gives a utility of 0. Model this as an extensive form game and find its Nash equilibria. Which of the Nash equilibria are subgame perfect?

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

There is a first-priced auction where 3 players value object at v1=v2=90 and v3=70. Player with highest bid wins object and pays own bid. Player i's payoff is vi-bi. When there is a tie, winner is player with smallest number (ex. player 2 wins if ties with player 3). 1) Is (90,90,70) a Nash equilibrium? 2) Can player 3 win in a Nash equilibrium if it was second-price auction?
Consider that there is one auctioneer who would like to sell one commodity and there are 2 individuals, 1 and 2. The auctioneer will apply the following tie-breaking rule: If there are multiple bidders who announce the highest bid, then select the bidder with the smallest index will be picked up as the winner. (For instance, let b(i) = b(j) . Then, i is the winner if and only if i < j.) Let each individual i's private value of the commodity, v(i), is given as: v(1) = $1600; v(2) = $2100. Considering a first-price auction, specify the set of Nash equilibria in this game.
Jane is interested in buying a car from a used car dealer. Her maximum willingness to pay for thecar is 12 ($12,000). Bo, the dealer, is willing to sell the car as long as he receives at least 9($9,000). What is the Nash bargaining solution to this game?
Maipo and Pisco need to decide how to divide a cake between the two of them. Both like cake and want to get as much cake as they can. They decide to let Maipo cut the cake first and then Pisco gets to pick which piece he wants. For simplicity, assume that Maipo can only cut the cake in two ways: He can either divide it into two pieces that are equal size (i.e., both will get half the cake) or he can divide the cake into two pieces where one piece is twice the size of the other (i.e., one will get a piece that is two-thirds of the cake and the other will get a piece that is one-third of the cake). a. Set up this game as a sequential game and draw the game tree that represents it Note: You can either draw the game tree by hand and then photograph/scan the tree and paste it into the assignment or use the drawing tool in Word to draw the tree. b. Find the sub-game perfect Nash Equilibria to this game. Underline the strategies or highlight the game tree path to show what the Nash Equilibria…
In a three stage alternating offers bargaining game, player 1 demands a fraction x of $100. If this is accepted by player 2, the $100 is split between the players with outcome ($100x,$100(1 - x)). Otherwise, at stage 2, player 2 makes a demand for a fraction y. If this is accepted by player 1, the $100 is divided accordingly but otherwise player 1 can make another offer and demand a fraction z. If that offer is rejected by player 2, the outcome is (0,0). Both players have a discount factor of 1/2. (a) Find a perfect equilibrium for this game. (b) Is there a first-mover advantage?
Three players (player 1, player 2 and player 3) each chooses a positive integer QE {1, 2, 3, . 100}. If all three players choose the same integer Q, each player gets $100/3. If all three players choose different integers, the player with the largest integer gets $100, and the two other players get $0. If two players choose the same integer Q, and the third player chooses a different integer Q', then the player playing Q' gets $0, and the two players who played Q get $50 each. Find 2 Nash equilibriums in this game. ....
A total of 10 players are each choosing a number from {0,1,2,3,4,5,6,7,8}. If a player's number equals exactly half of the average of the numbers submitted by the other nine players, then she is paid $100; otherwise, she is paid 0. Solve for the strategies that survive the IDSDS.
In this game, (80, 50) 52% a) (R, N) b) (R, R) c) (S, N) d) (R, P) S is a Nash equilibrium First Player (20,68) 12% R P Second Player N (90,70) 36%
A and B are a couple and they want to go into a concert. A comes from Bonn and loves the music of Ludwig van Beethoven. B comes from Salzburg and loves the music of Wolfgang Amadeus Mozart. There are two concerts in town: one with the music of Beethoven and one with the music of Mozart. Both (A and B) prefer to go to a concert together. If both go to a concert of Beethoven, A has a pay-off of 4 and B has a pay-off of 2. If both go to a concert of Mozart, B has a pay-off of 4 and A has a pay-off of 2. If A goes to a concert of Mozart and B to a concert of Beethoven, they are both miserable and get a pay-off of 0. But, if B goes to a concert of Mozart and A to a concert of Beethoven, they are both a little better off with a pay-off of 1. Both A and B have to make a simultaneous decision and cannot communicate prior to the decision. (a) Construct the pay-off matrix for this game. (b) Identify the Nash equilibrium or equilibria of the game. (c) Which off the allocations are…
Problem 4: Consider an infinitely repeated game, where the base game is the following 2-person 2x2 game: A A 0,0 10, 10 S1: choose A always S2: choose B always B 10, 10 0,0 Assume both players discount the future at the same rate of r, 0 < r < 1. Limiting each player's strategies to the following six possibilities, S3: Choose A then mimic the other player's previous choice S4: Choose B, then mimic the other player's previous choice S5: Choose A, then choose the opposite of the other player's previous choice S6: Choose B, then choose the opposite of the other player's previous choice a. present the strategic form of this game, b. identify all pure-strategy Nash equilibria c. does repetition with these strategies "solve" the coordination dilemma that confronts the players in the single play of the above game.
Determine all of the Nash equilibria (pure-strategy and mixed-strategy equilibria) of the following game:
Player A and B each announce a color (red, white, blue, or green) simultaneously. The winner is determined by the following rules: red beats white, white beats blue, blue beats green, and green beats red. If both players announce the same color the game is a draw. The payoffs work as follows, if player A wins with red, she wins 5, if player A wins with white or blue, she wins 2, and if player A wins with green, she wins 3. If player B wins with red or white, he wins 4, if player B wins with blue he wins 3, and if player B wins with green he wins 5. The above description leaves out the cases where players announce colors that are not directly comparable. For example, there is no rule for what happens if one player announces white and the other announces green. In these situations, the winner is determined by examining the number of letters in each color that is announced. If both colors have the same number of letters, then the game is a draw. If there are a different number of letters…