Recognizing the Maximum of a Sequence
John Chatlos
John Chatlos
In this talk, we will study what is variously known as the "Beauty Contest Problem," "Secretary Problem," or "Dowry Problem." That is, we will discuss optimum strategies for finding sequentially the maximum of a random sequence of fixed length. Our agenda for this talk will be: (1) Couch the problem in more modern terms, and (2) Find an asymptotic optimum strategy for our variant of the problem.
