3. Two vendors simultaneously choose a location. Then the customers choose the closest vendor to buy from. The profit for each vendor equals the number of customers that it attracted. Assume that the vendors choose a location from the set {1,2,3,4,5} of natural numbers, viewed as points on a real line, and that at each location there is exactly one customer. For example, for n = 5 there are 5 locations and when the players choose respectively the locations 2 and 5, their payoffs are u(2,5) = 3 and u2(2,5) = 2. When the vendors share a customer, for instance, when they choose respectively the locations 2 and 4, they end up with a fractional payoff, in this case u(2,4) : 2.5 and u2(2,4) 2.5. In general, each vendor's strategy set is Si = {1,2,3,4,5} for i 1, 2. The outcome of IESDS is

3. Two vendors simultaneously choose a location. Then the customers choose the closest vendor to buy from. The profit for each vendor equals the number of customers that it attracted. Assume that the vendors choose a location from the set {1,2,3,4,5} of natural numbers, viewed as points on a real line, and that at each location there is exactly one customer. For example, for n = 5 there are 5 locations and when the players choose respectively the locations 2 and 5, their payoffs are u(2,5) = 3 and u2(2,5) = 2. When the vendors share a customer, for instance, when they choose respectively the locations 2 and 4, they end up with a fractional payoff, in this case u(2,4) : 2.5 and u2(2,4) 2.5. In general, each vendor's strategy set is Si = {1,2,3,4,5} for i 1, 2. The outcome of IESDS is

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

Suppose that Jason and Chad each are thinking of opening up a diet coke stand on the fourth floor of this building. Suppose that potential customers are evenly spaced on a distance that is normalized to 1. Customers will buy a diet coke from whichever stand requires the least walking. If they are the same distance the customer will flip a coin. This is depicted below. 1/4 1/2 3/4 If Jason is currently at 3/4, what is Chad's best response? a. Just left of 3/4 b. 1/2 c. Just right of 3/4 d. Just left of 1/2
Suppose that Jason and Chad each are thinking of opening up a diet coke stand on the fourth floor of this building. Suppose that potential customers are evenly spaced on a distance that is normalized to 1. Customers will buy a diet coke from whichever stand requires the least walking. If they are the same distance the customer will flip a coin. This is depicted below. 1/4 1/2 3/4 Suppose that Jason and Chad are simultaneously choosing the location of their stands, what is the Nash Equilibrium location? a. One of them puts a stand at 3/4 and the other puts a stand at 1/4 b. Chad and Jason put their stands right next to each other at 1/2 c. One of them puts a stand at 0 and the other puts a stand at 1 d. There is no Nash Equilibrium
Two oil companies are deciding how much oil to extract from their properties, which lie above the same underground reservoir. The faster that oil is extracted, the less total oil is extracted. Letting x denote the extraction rate for company X and y denote the extraction rate for company Y, we assume that the total amount of oil extracted is 1/(x + y) million gallons of oil. Of the total amount that is extracted, the share going to company X is x/(x + y), and the share to company Y is y/(x + y); that is, a company’s share depends on how fast it extracts compared with the other company. The price of oil is $100 per gallon. Each company chooses its extraction rate from the interval [1,10] in order to maximize the monetary value of the oil that it extracts. Find the Nash equilibrium extraction rates. (Note: You can assume that the payoff function is hill shaped.)
$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.
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…
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?
There is a beach with nine regions in it and two pop sellers must choose in which region to situate. Customers in each region walk to the closest seller to buy a pop. Each pop is sold for $1 each. Suppose that the customers are not distributed evenly across the regions. Regions 2 through 9 each have 10 customers but region 1 has x customers. For what values of x does the strategy of locating in region 2 dominate locating in region 1? In particular, what is the maximum value of x for this to be true? Please show all your calculations in your written solution.
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.
In a sideshow game. A player gets 3 balls to place into a Clown's mouth. Each ball is swallowed by the Clown and is then deposited into slots that can hold only 1 ball. Slots are numbered 1 to 9 and prizes are allocated to a player depending on the slot value of the three balls. If for example the first ball landed in slot 8, the second in slot 2 and the third in slot 1, the resulting prize number would be 821 as shown in Figure 3. 3rd 2nd 1st dol 1 2 3 4 5 6 7 8 9 Figure 3: A prize number of 821 is shown for a side show game. a) How many resulting prize numbers are possible in this game? b) How many resulting prize numbers are possible that end with the number 1?
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…
Consider the following game. There are two payers, Player 1 and Player 2. Player 1 chooses a row (10, 20, or 30), and Player 2 chooses a column (10/20/30). Payoffs are in the cells of the table, with those on the left going to Player 1 and those on the right going to player 2. Suppose that Player 1 chooses his strategy (10, 20 or 30), first, and subsequently, and after observing Player 1’s choice, Player 2 chooses his own strategy (of 10, 20 or 30). Which of the following statements is true regarding this modified game? I. It is a simultaneous move game, because the timing of moves is irrelevant in classifying games.II. It is a sequential move game, because Player 2 observes Player 1’s choice before he chooses his own strategy.III. This modification gives Player 1 a ‘first mover advantage’. A) I and IIB) II and IIIC) I and IIID) I onlyE) II only
The Stag Hunt Game - A group of 10 hunters are hunting, where the games include a stag and several (>10) hares. Each hunter can choose whether to hunt the stag or go after a hare. It takes the joint effort of all 10 players to catch the stag, but each hunter on their own is able to catch a hare. Suppose that a stag is worth $100 and a hare is worth $9. Suppose also that when all 10 players together catch the stag, they each get $10 after the game is sold. (a) Formulate this situation as a strategic game and find the Nash equilibria. (b) Now suppose that there are still 10 hunters, who need to choose to either hunt the stag or catch a hare. However, suppose that only 6 hunters are needed to catch a stag. Assume further that after the stag is caught, it can still be sold for $100 and the money shall be divided evenly among the hunters who have chosen to join the stag hunt only. On the other hand, each hunter can always catch a hare on their own and sell it for $9. Formulate this…