Hostname: page-component-6bf8c574d5-h6jzd Total loading time: 0.001 Render date: 2025-02-17T15:47:47.177Z Has data issue: false hasContentIssue false
  • English
  • Français

Sharp bounds for winning probabilities in the competitive rank selection problem

Published online by Cambridge University Press:  14 July 2016

F. Thomas Bruss  and
Guy Louchard
F. Thomas Bruss
Affiliation:
Département de Mathématiques, Université Libre de Bruxelles, CP 210, Boulevard du Triomphe, B-1050 Bruxelles, Belgium. Email address: [email protected]
Guy Louchard
Affiliation:
Département d'Informatique, Université Libre de Bruxelles, CP 212, Boulevard du Triomphe, B-1050 Bruxelles, Belgium
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Letter to the Editor
Information
Journal of Applied Probability , Volume 35 , Issue 4 , December 1998 , pp. 1007 - 1011
Copyright
Copyright © Applied Probability Trust 1998 

References

Chen, R. W., Rosenberg, B., and Shepp, L. A. (1997). A secretary problem with two decision makers. J. Appl. Prob. 34, 1068–1074.CrossRefGoogle Scholar
Enns, E. G., and Ferenstein, E. (1985). The horse game. J. Operat. Res. Soc. Japan 28, 51–62.Google Scholar
Enns, E. G., Ferenstein, E., and Sheahan, J. N. (1986). A curious recursion arising in game theory. Utilitas Math. 30, 219–228.Google Scholar
Rényi, A. (1962). Théorie des éléments saillants d'une suite d'observations. Proc. Coll. Comb. Methods in Probability Theory, Aarhus Universitet, pp. 104–115.Google Scholar