(b) Suppose there are two roommates John and Bill; each has a wealth of $1000. They are trying to decide whether or not to buy a TV that costs $800, when each of them values it at $600. They agree on the following procedure to decide whether or not to buy the TV. Each person will write on a piece of paper whether or not he thinks the TV should be purchased. If both say yes, they buy the TV and split the cost evenly. If both say no, they don't buy the TV. If one says yes, and the other says no, the person who says yes is obligated to buy the TV on his own. In this context, answer the following: (i) Is it Pareto efficient for the two roommates to buy the TV? and What is the dominant strategy of each player in this game? (ii)

(b) Suppose there are two roommates John and Bill; each has a wealth of $1000. They are trying to decide whether or not to buy a TV that costs $800, when each of them values it at $600. They agree on the following procedure to decide whether or not to buy the TV. Each person will write on a piece of paper whether or not he thinks the TV should be purchased. If both say yes, they buy the TV and split the cost evenly. If both say no, they don't buy the TV. If one says yes, and the other says no, the person who says yes is obligated to buy the TV on his own. In this context, answer the following: (i) Is it Pareto efficient for the two roommates to buy the TV? and What is the dominant strategy of each player in this game? (ii)

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

Cooper and Rebecca run the only two lawncare companies in a small town. If they worked independently, they would each earn $3000. If they cooperated, they know they could raise the price of their lawncare services and service fewer lawns, but can each earn $4500. If one person raises prices and other does not, the person who raises prices will earn $1000 and the other will earn $6000. Draw a table representing their dilemm
Not Play 1 Play 11 2 1 Trust Distrust 1 Steal Share 0 2 10 0 55 5 5 Find all of the pure strategy Nash Equilibria of this game. There can be more than one equilibrium. [Here ((Not Play, Steal), (Trust)) indicates that player 1 chooses Not Play at the first decision node and Steal at the second decision node, and 2 chooses Trust at his unique decision node.] a) ((Play, Share), (Trust)) b) ((Not play, Share), (Distrust)) c) ((Not play, Steal), (Distrust)) d) ((Not play, Steal), (Trust)) ☐ e) ((Play, Steal), (Distrust))
Sophia is a contestant on a game show and has selected the prize that lies behind door number 3.The show’s host tells her that there is a 50% chance that there is a $15,000 diamond ring behindthe door and a 50% chance that there is a goat behind the door (which is worth nothing to Sophia,who is allergic to goats). Before the door is opened, someone in the audience shouts, “I will giveyou the option of selling me what is behind the door for $8,000 if you will pay me $4,500 for thisoption.” [Assume that the game show allows this offer.]a. If Sophia cares only about the expected dollar values of various outcomes, will she buythis option?b. Explain why Sophia’s degree of risk aversion might affect her willingness to buy thisoption
Answer quickly 1,2 and 3 Questions?asap
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.)
Exercise 4.1 Amy and Bill simultaneously write a bid on a piece of paper. The bid can only be either 2 or 3. A referee then looks at the bids, announces the amount of the lowest bid (without revealing who submitted it) and invites Amy to either pass or double her initial bid. - The outcome is determined by comparing Amy's final bid to Bill's bid: if one is greater than the other then the higher bidder gets the object and pays his/her own bid; if they are equal then Bill gets the object and pays his bid. Represent this situation by means of two alternative extensive frames. Note: (1) when there are simultaneous moves we have a choice as to which player we select as moving first: the important thing is that the second player does not know what the first player did; (2) when representing, by means of information sets, what a player is uncertain about, we typically assume that a player is smart enough to deduce relevant information, even if that information is not explicitly given to…
Consider the following situation. 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). 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. Find the sub-game perfect Nash Equilibria to this game. Underline the strategies or highlight the…
Table 22-21 Three longtime friends-Linda, Stella, and Lydia are deciding how they will spend their Sunday afternoon. They all agree that they should do one of the three things: go to a comedy club, play soccer, or go to a tennis tournament. They also agree that they will have two pairwise votes to determine how to spend their afteroon, with the majority determining the outcome on each vote. The first, second, and third choices for each person are as indicated in the following table. First choice Second choice Third choice Linda tennis tournament soccer comedy club Stella soccer comedy club tennis tournament Lydia comedy club tennis tournament soccer Refer to Table 23-2. If (1) the first vote pits "tennis tournament" against "comedy club," and (2) the second vote pits "soccer against the winner of the first vote, then the outcome is as follows: ⒸA "Tennis tournament" wins the first vote and "tennis tournament" wins the second vote, so they go to a tennis tournament OB. "Tennis…
Economics 4. Suppose you are going to play a game with four other people in our class. The rule of the game is that: each of them will choose a number between and 100 (including 0 and 100). The winner of the game is the one whose chosen number is the closest to [20+* average of everyone's chosen number]. The winner can get $100 form Josie. Everyone choosing 20 is a Nash Equilibrium. (a) True (b) False please explain it in detail.
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?
Rita is playing a game of chance in which she tosses a dart into a rotating dartboard with 8 equal-sized slices numbered 1 through 8. The dart lands on a numbered slice at random. This game is this: Rita tosses the dart once. She wins $1 if the dart lands in slice 1, $2 if the dart lands in slice 2, $5 if the dart lands in slice 3, and $8 if the dart lands in slice 4. She loses $3 if the dart lands in slices 5, 6, 7, or 8. (If necessary, consult a list of formulas.) (a) Find the expected value of playing the game. | dollars (b) What can Rita expect in the long run, after playing the game many times? O Rita can expect to gain money. She can expect to win dollars per toss. Rita can expect to lose money. She can expect to lose dollars per toss. O Rita can expect to break even (neither gain nor lose money).
Please explain how to solve the question and arrive at the provided answer. Thank you.