Three Cards of Unknown Offset
You have three face-down cards bearing the values , , in some unknown order, where itself is unknown to you. You turn over one card at a time, in a fixed order, revealing only its numerical value. After seeing a card’s value you may either stay (collecting that value as your payout) or discard it and reveal the next card; you must stay after the third card is revealed if you have not already stopped. Using the optimal stopping strategy, the expected payout equals for a constant . Find .
Work it out, then compare with the answer.
SolutionShow the worked solution
Key idea. Since is unknown, a card’s face value tells you nothing by itself. Only differences between revealed cards carry information. So we assume the order of the cards is uniformly random, and we restrict attention to strategies that depend only on these differences. Then every payout has the form , where is the offset of the card you keep. We maximise over the equally likely orders of the offsets .
Stopping at once. At the first card you have no information. Stopping gives .
Decision at the second card. Suppose the first card is and the second is , and write . Each value of is consistent with some of the orders below. In each case, compare the offset you get by staying with the offset of the third card.
- : the order is . Staying gives and the third card gives , so stay: .
- : the order is . Staying gives and the third card gives , so continue: .
- : the order is or . Staying gives (total ) and continuing gives (total ), so stay: total .
- : the order is or . Staying gives (total ) and continuing gives (total ), so continue: total .
Summing the best totals over all six orders gives . So after passing the first card, the optimal continuation gives . This exceeds the value of stopping at once, so the optimal strategy is as follows:
- always pass the first card;
- keep the second card if it is higher than the first;
- otherwise take the third card.
Its expected payout is , so