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? Rita can expect to gain money. She can expect to win | dollars per toss. O 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).

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? Rita can expect to gain money. She can expect to win | dollars per toss. O 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).

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.7P

See similar textbooks

Similar questions

Each of the two players independently (and simultaneously with the other) decides whether to go to a play or a concert. Each would rather go with the other to a concert than with them to a play, but prefers this to not being together, in which case they don't care where they go alone. Additionally, each is indifferent between attending the play together and participating in a lottery where both go to the concert with a probability of ¾ and to different events with a probability of ¼. Describe the game in matrix form and find all its equilibria under the assumption that the players have von Neumann-Morgenstern preferences.
Consider the game of Chicken in which each player has the option to “get out of the way” and “hang tough” with payoffs: Get out of the way Hang tough Get out of the way 2,2 1,3 Hang tough 3,1 00 a. Find all pure strategy Nash equilibria, if they exist b. Let k be the probability that player 1 chooses “hang tough” and u be the probability that player two chooses “hang tough.” Find the mixed stragety Nash equilibria, if they exist
Two 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…
The mixed stratergy nash equalibrium consists of : the probability of firm A selecting October is 0.692 and probability of firm A selecting December is 0.309. The probability of firm B selecting October is 0.5 and probability of firm selecting December is 0.5. In the equilibrium you calculated above, what is the probability that both consoles are released in October? In December? What are the expected payoffs of firm A and of firm B in equilibrium?
Matthew is playing snooker (more difficult variant of pool) with his friend. He is not sure which strategy to choose for his next shot. He can try and pot a relatively difficult red ball (strategy R1), which he will pot with probability 0.4. If he pots it, he will have to play the black ball, which he will pot with probability 0.3. His second option (strategy R2) is to try and pot a relatively easy red, which he will pot with probability 0.7. If he pots it, he will have to play the blue ball, which he will pot with probability 0.6. His third option, (strategy R3) is to play safe, meaning not trying to pot any ball and give a difficult shot for his opponent to then make a foul, which will give Matthew 4 points with probability 0.5. If potted, the red balls are worth 1 point each, while the blue ball is worth 5 points, and the black ball 7 points. If he does not pot any ball, he gets 0 point. By using the EMV rule, which strategy should Matthew choose? And what is his expected…
Samiyah 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?
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
There are N women that all share the same toilet every day in an office building. Each sits on the toilet to use it and must decide whether to put down toilet paper on top of the toilet or sit directly on it. The toilet is cleaned just once a day at a random time and no one knows when this is done. It takes time and effort to put down toilet paper so if she knew the toilet was clean (either because she is the first to use it after it was cleaned or if all previous users after it was last cleaned put down toilet paper) she would rather not put down toilet paper. However, if she believes the toilet is dirty she would rather put down toilet paper. a) Is this game best described as simultaneous or sequential move? b) How many equilibria are there in this game? c) Briefly provide a general description of the equilibria. Which equilibrium/equilibria provide the highest social payoff?
We have a group of three friends: Kramer, Jerry and Elaine. Kramer has a $10 banknote that he will auction off, and Jerry and Elaine will be bidding for it. Jerry and Elaine have to submit their bids to Kramer privately, both at the same time. We assume that both Jerry and Elaine only have $2 that day, and the available strategies to each one of them are to bid either$0, $1 or $2. Whoever places the highest bid, wins the $10 banknote. In case of a tie (that is, if Jerry and Elaine submit the same bid), each one of them gets $5. Regardless of who wins the auction, each bidder has to pay to Kramer whatever he or she bid. Does this game have a Nash Equilibrium? (If not, why not? If yes, what is the Nash Equilibrium?)
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?
If the players play pure strategies, the game has no Nash equilibrium. But what if they choose their moves randomly? Let each player instead opt for a mixed strategy instead of a pure strategy. The first will play action Z with probability p, and the second will play action L with probability q. At which pair (p, q) are the mixed strategies of the players in equilibrium? At which pair (p, q) does neither player want to change strategy? When are both strategies simultaneously the best response?
We’ll now show how a college degree can get you a better job even if itdoesn’t make you a better worker. Consider a two-player game between aprospective employee, whom we’ll refer to as the applicant, and an employer. The applicant’s type is her intellect, which may be low, moderate,or high, with probability 1/3 , 1/2 , and 1/6 , respectively. After the applicantlearns her type, she decides whether or not to go to college. The personalcost in gaining a college degree is higher when the applicant is less intelligent, because a less smart student has to work harder if she is to graduate. Assume that the cost of gaining a college degree is 2, 4, and 6 for an applicant who is of high, moderate, and low intelligence, respectively.The employer decides whether to offer the applicant a job as a manageror as a clerk. The applicant’s payoff to being hired as a manager is 15,while the payoff to being a clerk is 10. These payoffs are independent ofthe applicant’s type. The employer’s payoff from…