%0 Journal Article %1 gm66 %A Gilbert, John P. %A Mosteller, Frederick %D 1966 %I American Statistical Association %J Journal of the American Statistical Association %K %N 313 %P 35--73 %R 10.2307/2283044 %T Recognizing the Maximum of a Sequence %U http://dx.doi.org/10.2307/2283044 %V 61 %X The classical dowry, secretary, or beauty contest problem is extended in several directions. In trying to find sequentially the maximum of a random sequence of fixed length, the chooser can have one or several choices (section 2), no information about the distribution of the values (section 2), or at the other extreme, full information about the distribution and the value of the observation itself (section 3). He can have an opponent who alters the properties of the sequence (section 4). The payoff function may be 0 or 1 (sections 2-4), or it may be the value of the observation itself as in certain investment problems (section 5). Both theoretical and numerical results are given for optimum and near optimum play.

@article{gm66, abstract = {The classical dowry, secretary, or beauty contest problem is extended in several directions. In trying to find sequentially the maximum of a random sequence of fixed length, the chooser can have one or several choices (section 2), no information about the distribution of the values (section 2), or at the other extreme, full information about the distribution and the value of the observation itself (section 3). He can have an opponent who alters the properties of the sequence (section 4). The payoff function may be 0 or 1 (sections 2-4), or it may be the value of the observation itself as in certain investment problems (section 5). Both theoretical and numerical results are given for optimum and near optimum play.}, added-at = {2010-01-14T09:15:59.000+0100}, at = {2008-06-09 18:32:01}, author = {Gilbert, John P. and Mosteller, Frederick}, biburl = {https://www.bibsonomy.org/bibtex/21f22460f983c2c5e0398f8b197737437/enterldestodes}, doi = {10.2307/2283044}, interhash = {16cc075cbd53ea12f60c08091a0c2fe5}, intrahash = {1f22460f983c2c5e0398f8b197737437}, journal = {Journal of the American Statistical Association}, keywords = {}, number = 313, pages = {35--73}, priority = {2}, publisher = {American Statistical Association}, review = {- Basis für die Informationssuche - Ausgearbeitet:}, timestamp = {2010-01-14T09:15:59.000+0100}, title = {Recognizing the Maximum of a Sequence}, url = {http://dx.doi.org/10.2307/2283044}, volume = 61, year = 1966 }