Dissection of a British TV Game
摘要
We take up a British TV game in its final round. Three contestants choose an integer from 0 to 10000 independently. One of the contestants wins if the chosen numbers are distinct and the chosen number of the contestant is in between the other chosen numbers. The winning amount is the winning number in British pounds. In this paper, we discuss distributions on {0, 1, 2, ..., 10000} the contestants can use for selecting numbers. We show that the Uniform Distribution is optimal maximizing the probability of selections being distinct. We generalize the problem to the continuous case.