12. Two people alternate choosing either to quit or to continue a process at various stages
numbered 1 to 1,001. If a person quits at stage n, that person gets $(n + 1), the opponent gets
$(n − 1), and no other payoffs are possible. If neither player ever quits, they reach stage
1,001, and each gets $1,000. Player 1 can choose to quit or continue at odd-numbered
stages; player 2 can choose at even-numbered stages. Both players care only for their own
payoffs and expect their opponent to do the same. No coordinating of strategies is allowed.
Backward induction predicts the average payoff to the two players will be: