Hostname: page-component-6898cfcb55-zsp5v Total loading time: 0 Render date: 2026-11-11T05:47:18.180Z Has data issue: false hasContentIssue false
  • English
  • Français

Extreme order statistics with cost of sampling

Published online by Cambridge University Press:  01 July 2016

James Pickands III
James Pickands III*
Affiliation:
University of Pennsylvania
*
∗ Postal address: Wharton Analysis Center, The Wharton School, University of Pennsylvania, Philadelphia, PA 19104, U.S.A.
Get accessRights & Permissions [Opens in a new window]

Abstract

Let X 1, X 2, …, Xn , … be mutually independent with common CDF F and, for each m, n, let Xm:n be the mth largest among the first n. We consider max1≤n<∞ (X 1:n – cn) and the ‘optimal stopping rule' N which maximizes where all l and In particular, we consider and All of these are considered for c ϵ (0,∞) as well as asymptotically as c → 0+.

Keywords

EXTREME VALUESOPTIMAL STOPPING

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 15 , Issue 4 , December 1983, pp. 783 - 797
Copyright
Copyright © Applied Probability Trust 1983 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Research supported by the United States Department of Energy Contract DE-AC01-81RG10494.

References

Chow, Y. S., Robbins, H. and Siegmund, D. (1971) Great Expectations: The Theory of Optimal Stopping. Houghton-Mifflin, New York.Google Scholar
Galambos, J. (1978) The Asymptotic Theory of Extreme Order Statistics. Wiley, New York.Google Scholar
Pickands, J. Iii (1975) Statistical inference using extreme order statistics. Ann. Statist. 3, 119–131.Google Scholar
Resnick, S. J. (1971) Tail equivalence and applications. J. Appl. Prob. 8, 136–156.Google Scholar
Ross, S. (1970) Applied Probability with Optimization Applications. Holden-Day, San Francisco.Google Scholar