Abstract
The notion of distance was fruitfully utilized in previous chapters in order to develop tests of hypotheses for both complete and incomplete rankings. In this chapter we consider a more general framework for constructing tests of hypotheses. We begin by defining two sets of rankings: one set consists of all the rankings which are most in agreement with the observed ranking while the second set contains all the rankings which are most in agreement with the alternative hypothesis. A distance function is then defined between those two sets of rankings. The notion of distance between sets is well known in mathematics and is often taken to be the minimum distance between pairs of elements, one from each set. In the present statistical context however, the more workable definition of distance is chosen to be the average of all pairwise distances between pairs of rankings, one from each set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
