Answered You can hire a professional tutor to get the answer.
QUESTION
Draw a game tree assuming that Player A can either send 0, 25 or 75 MUs to player B, and that player B can either accept or punish 0, 5 or 10 MUs (so...
- Draw a game tree assuming that Player A can either send 0, 25 or 75 MUs to player B, and that player B can either accept or punish 0, 5 or 10 MUs (so it costs A 0, 25 or 50). Calculate the subgame perfect Nash Equilibrium
