A hat contains the numbers 1-100. The rules to the game are as follows. Each round, AJ draws a number out of the hat, writes it down, and puts the number back in the hat. The last number written down is the number of dollars awarded to AJ. AJ may play as many rounds as he would like, but each round costs $1. Assuming optimal play, what is the fair value of this game?
解析
最优策略为“阈值停”:若抽到 ≥x 则停,否则继续。
计算可得最优整数阈值为 x=87,对应的期望净收益为
141209≈86.36.
Original Explanation
We want to determine an optimal threshold x, where, if AJ's draw is at least x, then he will not play another round. Notice that, if AJ draws again, without taking into consideration the 1penalty,thenAJ′sexpectedpayoffisthesameasthepreviousround.So,wecanwritethefollowingexpression,where\mathbb{E}[A]$ denotes the total winnings.