.png){kind=icon}
.png){kind=icon}
Return
Nonparametric mean estimation using partially ordered sets
.png){kind=icon}
PRE
AI
DOI：10.1007/s10651-012-0188-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In ranked-set sampling (RSS), the ranker must give a complete ranking of the units in each set. In this paper, we consider a modification of RSS that allows the ranker to declare ties. Our sampling method is simply to break the ties at random so that we obtain a standard ranked-set sample, but also to record the tie structure for use in estimation. We propose several different nonparametric mean estimators that incorporate the tie information, and we show that the best of these estimators is substantially more efficient than estimators that ignore the ties. As part of our comparison of estimators, we develop new results about models for ties in rankings. We also show that there are settings where, to achieve more efficient estimation, ties should be declared not just when the ranker is actually unsure about how units rank, but also when the ranker is sure about the ranking, but believes that the units are close.
Keywords:
Imperfect rankings
Isotonic estimation
Judgment post-stratification
Ranked-set sampling
Ties in rankings
Journal
IF:
1.8
Papers:
1.0K
Citations:
1.1K
Organization
No organization information available