Microeconomics (2nd Edition) (Pearson Series in Economics)
2nd Edition
ISBN: 9780134492049
Author: Daron Acemoglu, David Laibson, John List
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 5P
(a)
To determine
The maximum number of fishes caught collectively.
(b)
To determine
The number of fish collected by person J, if J knows that remaining 9 fishers are fishing lightly collectively.
(c)
To determine
The number of fish collected by person J, if J knows that remaining 9 fishers are fishing intensely collectively.
(d)
To determine
The condition in which one individual can be better off by fishing lightly on first day, if possible.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Three players (Allen, Mark, Alice) must divide a cake among them. The cake is divided into three slices.The table below shows the value of each slice in the eyes of each of the players.
S1
S2
S3
Allen
$7.00
$6.00
$5.00
Mark
$4.00
$4.00
$4.00
Alice
$5.00
$4.00
$6.00
Which of the slices does Allen deem fair?
Group of answer choices
S1 and S2
S1 and S3
S2 and S3
S1, S2, and S3
S1 only
Two individuals each receive fifty dollars to play the following game. Independently of each other, they decide how much money to put in a common pot. They keep the rest for themselves. As for the money in the pot, it is increased by 80% and then distributed equally among the two individuals. For instance, suppose that the first individual puts $10 in the pot while the second individual puts $20. Increasing the total pot of $30 by 80% gives $54 to share equally between the two individuals. So the first individual’s payoff in this case is $(40 + 27) = $67, while the second individual’s payoff is $(30 + 27) = $57.
(a) Compute the Nash equilibrium.
(b) Is the Nash equilibrium Pareto efficient? Explain
Two friends are deciding where to go for dinner. There are three choices, which we label A, B, and C.
Max prefers A to B to C. Sally prefers B to A to C.
To decide which restaurant to go to, the friends adopt the following procedure:
First, Max eliminates one of three choices.
Then, Sally decides among the two remaining choices.
Thus, Max has three strategies (eliminate A, eliminate B, and eliminate C). For each of those strategies, Sally has two choices (choose among the two remaining).
a.Write down the extensive form (game tree) to represent this game.
b.If Max acts non-strategically, and makes a decision in the first period to eliminate his least desirable choice, what will the final decision be?
c.What is the subgame-perfect equilibrium of the above game?
d. Does your answer in b. differ from your answer in c.? Explain why or why not.
Only typed Answer
Chapter 9 Solutions
Microeconomics (2nd Edition) (Pearson Series in Economics)
Knowledge Booster
Similar questions
- A backpacker gets stranded on an island, and rescue is about a week away. Two cannibals live on the island. The cannibals are not friendly to each other, and both regularly attempt to eat the other. Both cannibals would like to eat the backpacker, but as we all know, a big meal makes one tired and defenceless. In the event that one of them eats the backpacker, the other might strike and eat the eater. Hence, if choosing to eat the backpacker, there is a risk of being eaten oneself. If both of them show up to eat the backpacker, they are friendly enough to share and split the backpacker in half. Both cannibals have a less desirable, vegetarian, diet available on the island.Let eating the (entire) backpacker or cannibal give a payoff of 2. A vegetarian diet is worth 1. Being eaten gives a payoff of 0.a) Write down the normal form representation of the game between the two cannibals.b) The backpacker realizes that the cannibals (otherwise) are highly intelligent and rational beings.…arrow_forwardSamiyah and DeAndre decide to play the following game. They take turns choosing either 1, 2, or 3. As each number is chosen, it is added to the previously chosen numbers. The winner is the player who chooses a number that brings the cumulative number to 10. For example, if Samiyah chooses and DeAndre chooses 2 (so the cumulative number is 5) and Samiyah chooses 2 and DeAndre chooses 3 then DeAndre wins as his choice of 3 results in the sum equaling 10. Using SPNE, who wins?arrow_forwardTwo players bargain over 1 unit of a divisible object. Bargaining starts with an offer of player 1, which player 2 either accepts or rejects. If player 2 rejects, then player 1 makes another offer; if player 2 rejects once more, then player 2 makes an offer. If player 1 rejects the offer of player 2, then once more it is the turn of player 1 where he makes two consecutive offers. As long as an agreement has not been reached this procedure continues. For example, suppose that agreement is reached at period 5, it follows that player 1 makes offers in period 1,2 then player 2 makes an o er in period 3, then player 1 makes offers in 4,5. Negotiations can continue indefinitely, agreement in period 't' with a division (x, 1- x) leads to payoffs ( , (1-x)).(The difference from Rubinstein's alternating offer bargaining is that player one makes two consecutive offers, whereas player 2 makes a single offer in her turn.) a. Show that there is a subgame perfect equilibrium in which player 2's…arrow_forward
- John and Jane usually vote against each other’s party in the SSC elections resulting to negating or offsetting their votes. If they vote for their party of choice, each of them gains four units of utility (and lose four units of utility from a vote against their party of choice). However, it costs each of them two units of utility for the hassle of actually voting during the SSC elections. A. Diagram a game in which John and Jane choose whether to vote or not to vote.arrow_forwardCameron 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?arrow_forwardSuppose two bidders compete for a single indivisible item (e.g., a used car, a piece of art, etc.). We assume that bidder 1 values the item at $v1, and bidder 2 values the item at $v2. We assume that v1 > v2. In this problem we study a second price auction, which proceeds as follows. Each player i = 1, 2 simultaneously chooses a bid bi ≥ 0. The higher of the two bidders wins, and pays the second highest bid (in this case, the other player’s bid). In case of a tie, suppose the item goes to bidder 1. If a bidder does not win, their payoff is zero; if the bidder wins, their payoff is their value minus the second highest bid. a) Now suppose that player 1 bids b1 = v2 and player 2 bids b2 = v1, i.e., they both bid the value of the other player. (Note that in this case, player 2 is bidding above their value!) Show that this is a pure NE of the second price auction. (Note that in this pure NE the player with the lower value wins, while in the weak dominant strategy equilibrium where both…arrow_forward
- 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…arrow_forwardConsider a variant of the three player majority game we introduced in class. The three players, 1, 2, and 3, again need to decide how to allocate one unit of resources amongst themselves by voting. However, now player 1 has 1 vote, player 2 has 2 votes, and player 3 has 3 votes. To pass a proposed allocation, at least five votes are required. So, any coalition that does not possess at least five votes has only one action that gives each of its members zero resources, while any coalition that does possess at least five votes can choose any allocation of the one unit of resources amongst its members (e.g., an action of the grand coalition is simply an allocation (x1, x2, x3) such that xi ≥ 0 for all i is the portion of resources allocated to player i and x1 + x2 + x3 ≤ 1). Find the core of this game.arrow_forwardTwo mining companies, Red and Blue, bid for the right to drill a field. The possible bids are $ 15 Million, $ 25 Million, $ 35 Million, $ 45 Million and $ 50 Million. The winner is the company with the higher bid.The two companies decide that in the case of a tie (equal bids), Red is the winner and will get the field.Company Red has ordered a geological survey and, based on the report from the survey, concludes that getting the field for more than $ 45 Million is as bad as not getting it (assume loss), except in case of a tie (assume win). 1)Considering all possible combinations of bids, formulate the payoff matrix for the game. 2) Verify: does the game have a saddle point? 3)arrow_forward
- Consider the following Bayesian game. There are two players 1 and 2. Both players choose whether to play A or B. Two states are possible, L and R. In the former, players play a stag-hunt game, and in the latter, players play a matching pennies game. Suppose that Player 2 knows the state, while Player 1 thinks that the state is L with probability q and R with probability 1 ! q. Payo§s in each state respectively satisfy: Player 1 is the row player, and their payo§ is the first to appear in each entry. Player 2 is thecolumn player and their payo§ is the second to appear in each entry. (a) What is the set of possible strategies for the two players in this game? (b) Find all the pure strategy Bayes Nash equilibria for any value of q 2 (0, 1).arrow_forwardA clothing store and a jeweler are located side by side in a shopping mall. If the clothing store spend C dollars on advertising and the jeweler spends J dollars on advertising, then the profits of the clothing store will be (36 + J )C - 2C 2 and the profits of the jeweler will be (30 + C )J - 2J 2. The clothing store gets to choose its amount of advertising first, knowing that the jeweler will find out how much the clothing store advertised before deciding how much to spend. The amount spent by the clothing store will be Group of answer choices $17. $34. $51. $8.50. $25.50.arrow_forwardJill and Jack both have two pails that can be used to carry water down from a hill. Each makes only one trip down the hill, and each pail of water can be sold for $4. Carrying the pails of water down requires considerable effort. Both Jill and Jack would be willing to pay $2 each to avoid carrying one pail down the hill, and an additional $3 to avoid carrying a second pail down the hill.a. If Jack and Jill each must decide whether to carry one or two pails of water down from the top of the hill, how many pails will each child choose to carry? ___ pail(s)b. Jill and Jack’s parents are worried that the two children don’t cooperate enough with one another. Suppose they make Jill and Jack share equally their revenues from selling the water. Given that both are self-interested, construct the payoff matrix for the decisions Jill and Jack face regarding the number of pails of water each should carry. Carry 1 pail Jack Carry 2 pails…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Principles of Economics, 7th Edition (MindTap Cou...EconomicsISBN:9781285165875Author:N. Gregory MankiwPublisher:Cengage LearningManagerial Economics: A Problem Solving ApproachEconomicsISBN:9781337106665Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike ShorPublisher:Cengage Learning
Principles of Economics, 7th Edition (MindTap Cou...
Economics
ISBN:9781285165875
Author:N. Gregory Mankiw
Publisher:Cengage Learning
Managerial Economics: A Problem Solving Approach
Economics
ISBN:9781337106665
Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor
Publisher:Cengage Learning