The Decision Tree Depicts Two Players (Jane and Aaron) Playing

The decision tree depicts two players (Jane and Aaron) playing an ultimatum game where Aaron is given $1,000 and asked to propose a way of splitting it with Jane. When Jane learns Aaron’s proposal, Jane chooses whether to accept or reject the split. If Jane accepts the split, both players receive the money according to Aaron’s split proposal. If Jane rejects the split, both players receive nothing. This game will be played only once, so Aaron does not have to worry about reciprocity when making his choice.
There are four sets of payoffs at the terminal nodes of the decision tree. In each node, the dollar amount to the left of the comma represents Aaron’s payoff, and the dollar amount to the right of the comma represents Jane’s payoff.


-If Aaron could be 100% certain that Jane was rational, did not care about fairness, and always made decisions to maximize her payoff regardless of the situation she might find herself in, Aaron would likely offer a(n) :

A) unfair proposal and ultimately receive a payoff of $500.
B) unfair proposal and ultimately receive a payoff of $999.
C) unfair proposal and ultimately receive a payoff of $0.
D) fair proposal and ultimately receive a payoff of $500.
E) fair proposal and ultimately receive a payoff of $0.