14
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Optimal transitive procedures for comparing large numbers of parameters

Pages 1155-1172 | Received 01 Nov 1995, Published online: 27 Jun 2007
 

Abstract

Independent random samples are selected from each of a set of N independent populations, P1,…,Pn. Interest centers around comparing N (unknown) scalar parameters θ1,…,θN associated respectively with the N populations P1,…,Pn. Procedures are constructed for estimating the magnitude of each of the differences δt,j = θi − θj (1 ≤ i,j ≤ N) between pairs of populations. A loss function which adopts appropriate penalties for magnitude errors in estimation of differences is constructed. Magnitude estimators of differences are called transitive if they give rise to a transitive (i.e., consistent) relationship between pairwise differences of parameters. We show how to construct optimal effcient transitive magnitude–estimation procedures and demonstrate their usefulness through an example involving estimating the magnitude of the differences between disease incidence in paired towns for different pairs. Optimal transitive pairwise–comparison procedures are optimum (i.e., have the smallest posterior Bayes risks) in the class of all transitive pairwise–comparison procedures; as such they replace classical Bayes procedures which are usually not transitive when the number N of parameters compared is large. The posterior Bayes risk of optimal transitive pairwise comparison procedures are compared with that for alternative ‘adapted’ procedures, constructed from optimal simultaneous estimators and adapted for the purpose of pairwise comparisons. It is shown that the optimal transitive pairwise comparison procedures dominated the adapted procedures (in posterior Bayes risk) and typically represent only a small increase in posterior risk over the classical Bayes procedures which generally fail to be consistent. Optimal Bayes procedures are shown, for large numbers of parameters to be reasonably easy to construct using the algorithms outlined in this paper

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.