Bounds on the efficiency of unbalanced ranked-set sampling
From MaRDI portal
Publication:5085576
DOI10.1080/03610926.2018.1543769OpenAlexW2913699475WikidataQ128421063 ScholiaQ128421063MaRDI QIDQ5085576FDOQ5085576
Authors: Jesse Frey
Publication date: 27 June 2022
Published in: Communications in Statistics: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610926.2018.1543769
Cites Work
- On unbiased estimates of the population mean based on the sample stratified by means of ordering
- The calculus of variations
- Constrained nonparametric estimation of the mean and the CDF using ranked-set sampling with a covariate
- An improved mean estimator for judgment post-stratification
- Title not available (Why is that?)
- The Equivalence of Neyman Optimum Allocation for Sampling and Equal Proportions for Apportioning the U.S. House of Representatives
- Efficiency bounds for a generalization of ranked-set sampling
- Finding the maximum efficiency for multistage ranked-set sampling
Cited In (8)
- A general result for selecting balanced unequal probability samples from a stream
- Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
- Measures of information for maximum ranked set sampling with unequal samples
- Unbalanced Ranked Set Sampling for Estimating A Population Proportion Under Imperfect Rankings
- Memory type ratio and product estimators under ranked-based sampling schemes
- CDF estimation in multistage pair ranked set sampling
- Efficiency comparisons for partially rank-ordered set sampling
- Unifying presampling via concentration bounds
This page was built for publication: Bounds on the efficiency of unbalanced ranked-set sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085576)