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

An object is sold in a first-price auction – thus, the highest bidder wins the object and price is equal to the highest bid. There are two bidders, an "Odd" bidder (player 1) and an "Even" bidder (player 2). The odd bidder must bid an odd integer between 1 and 9, while the Even bidder must bid an even integer between 2 and 10. (So the strategy sets are {1,3, ...,9} and {2,4, ..., 10}.) The value of the object to the Odd bidder is 8, and value of the object to the Even bidder is 7. The payoff to the winner is the value of the object minus the price, and the payoff to the loser is 0. (a) Write the game in its strategic form. (b) Find all Nash equilibria.
2. Consider the two-player strategic form game represented in the following payoff table: t 1 m b 7,2 1,2 3,7 2 M 2,4 3,4 1,6 R 1,3 7,1 4,2 Player 1 chooses between rows, S₁ = {t, m, b), and receives the first listed payoff in each cell. Player 2 chooses between columns, S₂ = {L, M, R), and receives the second listed payoff in each cell. a. Does either player have a strictly dominant strategy? Explain. b. Explaining your steps carefully, identify the set of rationalizable strategies in this game. c. Making sure to explain your solution method, solve for all pure strategy Nash equilibria in this game.
5
For each of the following games, identify the backwards induction equilibrium and the equilibrium strategy for each player. 5. b. (1,1) (0,2) (2.2) (0,1) (1,) (1.0)
Give step by step answer with final answer
Table 3. This table shows a game played between two firms, Firm A and Firm B. In this game each firm must decide how much output (Q) to produce: 5 units or 6 units. The profit for each firm is given in the table as (Profit for Firm A. Profit for Firm B). Firm A Q=5 Q=6 Firm B Q=5 (24, 24) (30, 10) Q=6 (10,30) (19, 19) Refer to Table 3. The dominant strategy For Firm A is to produce Select one: O a. 5 units and the dominant strategy for Firm B is to produce 5 units. b. 5 units and the dominant strategy for Firm B is to produce 6 units. c. 6 units and the dominant strategy for Firm B is to produce 5 units. d. 6 units and the dominant strategy for Firm B is to produce 6 units.
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…
Team 2 plays A Team 2 plays B Team 2 plays C Team 1 plays A 9, 9 8, 12 6, 6 Team 1 plays B 6, 6 0, 7 5, 5 Team 1 plays C 12, 8 10, 10 7,0 Consider the simultaneous move game above in which two teams are competing against each other. Which of the following statements are true? In all Nash Equilibria of the game Team 2 plays B This game has two Nash Equilibria Team 1's best response to team 2 playing B is to play A. O None of the other answers are correct This game has a mixed strategy Nash Equilibria where a player randomizes over multiple options.
7
Given for the first photo and second photo for the question