代做ECON2101 Written Question 2代写C/C++程序

日期：2025-02-07 05:39

ECON2101

Written Question 2

1. Alice, Bill and their mother are deciding how to split a chocolate bar. Assume that the chocolate bar has 8 squares, so can only be divided into multiples of 8/1. Assume also that each only wants to maximise how much chocolate he or she gets.

(a) (1 point) Consider the following simultaneous move game: Alice, Bill and the mom each name a fraction of the chocolate bar that would be allocated to them. If the three fractions add up to a number less than or equal to 1, each player gets the share of the chocolate equal to the fraction they named (e.g. if the mom says 4/1 , Alice says 4/1 and Bill says 4/1 , each gets 4/1 of the chocolate). If the three fractions add up to more than 1, each player gets no chocolate. Name one Nash equilibrium of the game in which at least one player gets chocolate.

(b) (2 points) Does the game in (a) have any Nash equilibria in which no player gets any chocolate? If yes, state one such NE. If not, explain why not.

(c) (2 points) Consider the following sequential move game: in the first stage, the mom divides the chocolate bar into 3 pieces. In the second stage, Alice takes one of these three pieces. In the third stage, Bill takes one of the remaining two pieces. The mom then gets the piece that remains. This game has two SPNE. In both of them, the mom gets the same fraction of the chocolate. What is this fraction? Explain in two sentences, and feel free to include a drawing if it helps.