Consider the following simple model of the Mile End Park Beautification Initiative (from the lectures). There are two students, each of whom can choose to plant flowers (F) or not to plant flowers (N). If both students plant flowers, then the (flower appreciation) benefit is 130 to each player. If exactly one student plants flowers, then the benefit is 60 to each player. The cost to either player of planting flowers is c > 0, regardless of the other player's choice. Each student starts (before any costs or benefits) with a payoff of zero. The above assumptions lead to the following game in strategic form. 130 c, 130-c 60 c, 60 60, 60-c 0,0 Suppose that c< 130.

Consider the following simple model of the Mile End Park Beautification Initiative (from the lectures). There are two students, each of whom can choose to plant flowers (F) or not to plant flowers (N). If both students plant flowers, then the (flower appreciation) benefit is 130 to each player. If exactly one student plants flowers, then the benefit is 60 to each player. The cost to either player of planting flowers is c > 0, regardless of the other player's choice. Each student starts (before any costs or benefits) with a payoff of zero. The above assumptions lead to the following game in strategic form. 130 c, 130-c 60 c, 60 60, 60-c 0,0 Suppose that c< 130.

ECON MICRO

5th Edition

ISBN:9781337000536

Author:William A. McEachern

Publisher:William A. McEachern

Chapter10: Monopolistic Competition And Oligopoly

Section: Chapter Questions

Problem 3.10P

See similar textbooks

Similar questions

Consider the following game played by four individuals, players 1, 2, 3, and 4. Each individual has $10,000. Each player can donate between $0 and $10,000 to build a public park that costs $20,000. If they collect enough money, they construct the park, which is worth $9,000 to each of them. However, if they collect less than $20,000, they cannot build a park. Furthermore, regardless of whether the park is built or not, individuals lose any donations that they make. a) Describe the Nash equilibria for a simultaneous game. What makes them equilibria? Hint: There are many equilibria, so you may want to use a mathematical expression! b) Suppose that players 1, 2, and 3, each donate $4,000 for the park. How much will player 4 donate and why. What are the resulting payoffs for the players? c) Suppose instead that player 1 donated first, player 2 second, player 3 third, and player 4 last. Furthermore, players could only donate in intervals of 1,000 (0, $1,000, $2,000, etc.). How much will…
Two athletes of equal ability are competing for a prize of $12,000. Each is deciding whether to take a dangerous performance-enhancing drug. If one athlete takes the drug and the other does not, the one who takes the drug wins the prize. If both or neither take the drug, they tie and split the prize. Taking the drug imposes health risks that are equivalent to a loss of XX dollars. Complete the following payoff matrix describing the decisions the athletes face. Enter Player One's payoff on the left in each situation, Player Two's on the right. Player Two's Decision Take Drug Don't Take Drug Player One's Decision Take Drug , , Don't Take Drug , , True or False: The Nash equilibrium is taking the drug if X is greater than $6,000. True False Suppose there was a way to make the drug safer (that is, have lower XX). Which of the following statements are true about the effects of making the drug safer? Check all that…
Two street racers are playing a simultaneous game of chicken. They have to race towards each other and whoever swerves first is chicken and faces shame, a loss of 8. while the winner enjoys a gain of 3. If neither stop, they would crash into each other, a loss of 10. If both of them swerve at the same time, they are both chicken and face a loss of 5 each If player B destroys his own brakes before the race, and player A sees that, what would the new Nash equilibrium be in this case? a. Player A stops, Player B does not b. Player B stops, Player A does not c. Both players stop d. Neither players stop
**Practice*** Amy and Bob are playing the following board game:(I) Amy starts. She has three possible actions: Pass, Attack, or Defend.(II) Bob observes what Amy chose, and then chooses between three actions with the same names: Pass, Attack, or Defend.(III) If either player passes, or one attacks and the other defends, then the game ends. But if either both players attack, or if both players defend, then Amy has to choose between two actions: Respond or Not Respond. The payoffs are as follows:- If both players pass, both players get a payoff of 0.- If a player attacks and the other player defends, the player that attacks gets a payoff of 1, while the player that defended gets a payoff of 2.- If a player passes but the other player attacks or defends, the player who passes gets a payoff of -1, and the player who attacked or defended gets a payoff of 3.- If both players attack or both players defend:– If Amy responds, she gets a payoff of 4, and Bob gets a payoff of 0.– If Amy does…
Two athletes of equal ability are competing for a prize of $10,000. Each is deciding whether to take a dangerous performance enhancing drug. If one athlete takes the drug, and the other does not, the one who takes the drug wins the prize. If both or neither take the drug, they tie and split the prize. Taking the drug imposes health risks that are equivalent to a loss of X dollars. a) Draw a 2×2 payoff matrix describing the decisions the athletes face. b) For what X is taking the drug the Nash equilibrium? c) Does making the drug safer (that is, lowering X) make the athletes better or worse off? Explain.
Consider the game tree below (attached). In this game, each player can mover either Up (U) or Down (D). Player 1 moves first, then Player 2, and Player 3 moves last. Using backwards induction, clearly identify the choice that each player will make at each stage in the tree circle the ultimate outcome (payoff) to the game
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
two players, a and b are playing an asymmetrical game. there are n points on the game board. each turn player a targets a pair of points and player b says whether those two points are connected or unconnected. a can target each pair only once and the game ends when all pairs have been targeted. player b wins if a point is connected with all other points on the very last turn, while player a wins if any point is connected with all other points on any turn but the very last one or if no point is connected to all other points after the last turn. for what values of n does either player have a winning strategy?
Demonstrate the concept of coordination failure by using the payoff matrix and prove that, Coordination failure among economic agents can lead to an inefficient outcome while the opposite can guide to an efficient outcome. Use any hypothetical scenario to justify your analysis.
UNIT 9 CHAPTER 5 In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.
The US and Canada have overfished North Atlantic cod stocks nearly to the point of extinction. Both countries wish to preserve the cod industry (and hence the cod stocks), so the two countries sign an agreement to limit fish hauls. Each country has two possible strategies: comply with the agreement (limit fishing) or renege on the agreement (overfish). Each country’s payoffs for different strategy combinations are given in the matrix below. The numbers in the cells represent utilities, and the payoff ordering is (US, Canada). QUESTIONS: 1.If this is a one-shot game (i.e., it is played once), do the players have a dominant strategy? If so, what is it? Briefly explain your answer. 2.What is the equilibrium of this game? Is it Pareto-optimal? How do you know?
Each actor has two possible actions: reduce greenhouse-gas emissions or increase emissions. Each player's payoffs for various combinations of actions are shown in the cells: by convention, the row player (EU)'s payoffs are shown first, and the column player (China)'s payoffs are shown second. Based on this matrix, which of the following statements are true? A.The EU is better off reducing its emissions, but only if China also reduces its emissions B. China is better off increasing its emissions, but only if the EU also increases its emissions C.Both China and the EU are better off increasing their emissions, whatever the other player does D.All of the above E.None of the above