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). a. 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. b. Find the sub-game perfect Nash Equilibria to this game. Underline the strategies or highlight the game tree path to show what the Nash Equilibria is/are. c. Is/are the sub-game perfect Nash Equilibrium efficient? EXPLAIN.

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). a. 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. b. Find the sub-game perfect Nash Equilibria to this game. Underline the strategies or highlight the game tree path to show what the Nash Equilibria is/are. c. Is/are the sub-game perfect Nash Equilibrium efficient? EXPLAIN.

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

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?
Question 4 A bus is crowded for travel during peak hours. During such travel hours two daily passengers ‘Ali’ and ‘Hassan’ enter the Metro. Luckily, two adjacent seats are free in the bus. Each of them must decide whether to sit or stand. For both, sitting alone is more comfortable than sitting next to the other person, which in turn is more comfortable than standing.(Note: for all parts below consider Ali as ‘row player’ and Hassan as ‘column player’. Take the game as a simultaneous game NOT sequential). Show ALL steps and working in support to your answersa) Assume that both ‘Ali’ and ‘Hassan’ are altruistic, ranking outcomes according to the other person’s comfort and, out of politeness, prefer to stand than to sit if the other person stands. Model the situation as a strategic game b) Find any Nash equilibrium (equilibria) if it exists. c) Does a dominant strategy exist for either ‘Ali’ or ‘Hassan’ with these preferences?
Arif and Aisha agree to meet for a date at a local dance club next week. In their enthusiasm, they forget to agree which venue will be the site of their meeting. Luckily the town has only two dancing venues, Palms and Oasis. Having discussed their tastes in dancing venues last week, both know that Arif prefers Palms to the Oasis and Aisha prefers the Oasis to Palms. In fact, their payoffs reflect that if both go to Oasis, Aisha’s utility is 3 and Arif’s 2, while if both go to Palms Arif’s utility is 3 and Aisha’s is 2. If they do not go to the same venue, then they both have a utility of 0. (a) Write the payoff matrix and explain whether there are any pure Nash equilibria. Carefully explain what these are and why. Comment on the existence of any dominant strategy equilibria. (b) Please calculate mixed strategy equilibria, if any, and then derive the probability that Arif and Aisha will find themselves at the same venue. Carefully explain the steps to your solution; a numerical…
1. Alizeh and Kelly were traveling together and have gotten stranded at an airport overnight. They have no cash, but they did both think to bring granola bars and turkey sandwiches with them. They currently each have several granola bars and a few sandwiches. Alizeh announces that she'd be willing to give up a granola bar for one turkey sandwich. Kelly responds that turkey sandwiches are bigger than granola bars so she would be willing to give up a granola bar if she could get half a turkey sandwich. Is Kelly and Alizeh's current allocation of granola bars and turkey sandwiches efficient? Explain why or why not. (Note that you cannot rely on a rule here – you have to specifically explain why the allocation does or does not meet the definition of an efficient allocation.)
7