A cake valued at $40 is divided among five players (P1, P2, P3, P4, P5) using the last diminisher method. The players play in a fixed order, with P1 first, P2 second, and so on. In round 1, P1 makes the first cut and makes a claim on a C-piece. For each of the remaining players, the value of the current C-piece at the time it is their turn is given in the following table: Player 2 Player 3 Player 4 Player 5 Value of current C-piece $5.50 $8.75 $6.50 $9.00 Which player gets his or her share at the end of round 1 and round 2? What is the value of the share to the players receiving the share? Round 1: Player 3, value $8.00 Round 2: Player 5, value $9.00 Round 1: Player 5, approximate value $9.00 Round 2: Player 3, value $8.75 Round 1: Player 5, approximate value $9.00 Round 2: Player 3, value $8.00 Round 1: Player 4, approximate value $6.50 Round 2: Player 3, value $8.00 O b O d

A cake valued at $40 is divided among five players (P1, P2, P3, P4, P5) using the last diminisher method. The players play in a fixed order, with P1 first, P2 second, and so on. In round 1, P1 makes the first cut and makes a claim on a C-piece. For each of the remaining players, the value of the current C-piece at the time it is their turn is given in the following table: Player 2 Player 3 Player 4 Player 5 Value of current C-piece $5.50 $8.75 $6.50 $9.00 Which player gets his or her share at the end of round 1 and round 2? What is the value of the share to the players receiving the share? Round 1: Player 3, value $8.00 Round 2: Player 5, value $9.00 Round 1: Player 5, approximate value $9.00 Round 2: Player 3, value $8.75 Round 1: Player 5, approximate value $9.00 Round 2: Player 3, value $8.00 Round 1: Player 4, approximate value $6.50 Round 2: Player 3, value $8.00 O b O d

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

Only typed answer
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?
In this version of the ultimatum game experiment, one participant is given £100, and is told to offer to split that amount with another participant. The second player can either refuse to accept the division, in which case the participant receiving the £100 has to give it back, or can accept the division, in which case, the player receiving the money splits the £100 as proposed. For the participant who has to accept or reject the offer A) The best strategy is to accept any offer which meets the social norm for fairness. B) The best strategy is to threaten to turn down any transfer of less than £100 to ensure that the person receiving the money makes a fair offer. C) There is a dominant strategy to accept any offer because gaining some money is better than gaining no money D) There is a dominant strategy to turn down any offer other than £50 because an unequal split would be unfair.
Which of the above 4 statements is CORRECT?
Player 1 is an Internet service provider and Player 2 is a potential customer. They consider entering into a contract of service for a period of time. The provider decides between two levels of service: High or Low. The potential customer decides whether to Buy or Not Buy. When the potential customer calls customer service, the Internet service provider makes the initial offer.The potential customer then decides whether to Buy or Not Buy. Let’s say that the interaction ends after the potential customer makes their decision. Please set up the extensive form according to the following outcomes: i. If the Internet service provider offers Low and the potential customer doesn’t buy, they both make off with 1. ii. If the Internet service provider offers Low and the potential customer buys, the Internet service provider makes off with 3, and the customer receives 0. iii. If the Internet service provider offers High and the potential customer doesn’t buy, the Internet service provider makes…
There are three players who must each choose an “effort” level from 1 to 7, that is, Si = {1, 2, 3, ..., 7}. The payoff for each player i is ui(si, s−i) = 10 max{s1, s2, s3} − si. How many pure- strategy Nash equilibria are there? Select one: a.2 b.4 c.none of the other answers d.3 e.1
In Homework 1, we saw that there is no strict dominant strategy equilibrium in an inspection game. Thus, the players must randomize and play a mixed strategy in equilibrium. Suppose the agent shirks with probability p₁ and works with probability (1 - p₁), while the principal inspects with probability p2 and does not inspect with probability (1-P2). Find the mixed strategy equilibrium for this game. I NI S (0, -k) (w, -w) W (w c, p-w-k)| (wc, p-w) Table 1: Payoff matrix for the inspection game
Two firms are competing to establish one of two new wireless communication standards, A or B. A strategy is a choice of standard, and an outcome of this game is a choice of standard by each firm – for example, (A, B) represents the case where Firm 1 decides to develop standard A and Firm 2 develops standard B. Here, the first letter will always correspond to Firm 1’s decision, and the second letter to Firm 2’s decision. Firm 1 has the following preferences over outcomes, in order of highest to lowest preferred: it prefers (A, A) to (B, A) to (A, B) to (B, B). Firm 2 prefers (A, B) to (A, A) to (B, A) to (B, B). Suppose that firms simultaneously decide which standard to develop. What is the pure strategy Nash equilibrium? Is the answer (B,B)? If not please explian what is the answer?
Up Down Up Up Down Down Player 1 Player 2 In the game above, what is/are the EFFICIENT sub-game perfect Nash equilibrium? (up,up) (up,down) (down, up) (down, down) No EFFICIENT equilibrium exists P1 gets $100 P2 gets $100 P1 gets $10 P2 gets $10 P1 gets $15 P2 gets $5 P1 gets $110 P2 gets $10
Refer to the accompanying game. Firm A Firm B Low Price High Price Low Price (10,9) (15,8) High Price (−10,7) (11,11) What are the secure strategies for firm A and firm B, respectively?
QUESTION 12 This is a HOT SPOT question. You will need to evaluate the picture of the game below, and answer the question by clicking on a specific area (the hot spot) of the picture. Question: Are there any dominant strategies in this game? If there are, click on the box that corresponds to that dominant strategy (either UP, DOWN, LEFT, or RIGHT). If there aren't any anywhere outside of these boxes. If there are dominant strategies for both players, clicking on only one of them will suffice. Player 1 Player 2 Selected Coordinates Clear UP DOWN LEFT 45, 80 70, 100 RIGHT 50, 150 60, 60
Suppose there are two bidders for a single object. Each bidder has a value for the object, v1 and v2, which is randomly drawn uniformly from 0 to 80. (Note that this means the probability that a value is 25 or lower is 25/80, and more generally, the probability that a value is k or lower is k/80). Bidders see their own values but not the values of their rival bidders. Consider a first price sealed bid auction where the winner of the object is the bidder who submits the highest bid and pays the price that he bid. Suppose that you are bidder 1 and you believe that your rival always bids a constant fraction α of his value. (For example, if bidder 2’ value is 15, he will bid 15α.). 1. What is your expected winning probability of the auction from any given bid b1? (Hint, you win the auction when your bid amount b1 is greater than your opponent’s bid). 2. What is your expected payoff from any given bid, b1? (You need to write your answer as a function of v1, b1, and α). 3. Compute your best…