Procédures optimales pour le classement des t meilleurs articles parmi n au moyen de comparaisons binaires
Sobel, Milton
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique, Tome 6 (1972), p. 23-68 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1972-01-01
@article{M2AN_1972__6_3_23_0,
     author = {Sobel, Milton},
     title = {Proc\'edures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires},
     journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Mod\'elisation Math\'ematique et Analyse Num\'erique},
     volume = {6},
     year = {1972},
     pages = {23-68},
     mrnumber = {351830},
     zbl = {0277.05007},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/M2AN_1972__6_3_23_0}
}

Sobel, Milton. Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires. ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique, Tome 6 (1972) pp. 23-68. http://gdmltest.u-ga.fr/item/M2AN_1972__6_3_23_0/

[1] R. C. Bose and R. J. Nelson, A sorting problem, J. ACM, 1962, 9, 282-296. | MR 145695 | Zbl 0105.32405

[2] W. H. Burge, Sorting, trees and measures of order. Informat Contr., 1958, 1, 181-197. | MR 96558 | Zbl 0085.34301

[3] L. Carroll, Lawn tennis tournaments. (From The Complete Works of Lewis Carroll) 1883, N. Y. Modem Library, 1947 édition.

[4] Y. Cesari, Questionnaire, codage et tris. Thèse, Faculté des Sciences de Paris, 1967.

[5] H. A. David, Tournaments and paired comparisons. Biometrika, 1959, 46, 139-149. | MR 102445 | Zbl 0087.14901

[6] H. A. David, The Method of Paired Comparisons, 1963, Hofner Pub. Co., New York. | MR 174105 | Zbl 0665.62075

[7] F. Dubail, Algorithmes de questionnaires réalisables, optimaux au sens de différents critères. Thèse, Univ. de Lyon, 1967.

[8] L. R. Jr Ford and S. M. Johnson, A tournament problem. Amer. Math. Monthly, 1959, 66, 387-389. | MR 103159 | Zbl 0092.01303

[9] W. A. Glenn, A comparison of the effectiveness of tournaments. Biometrika, 1960, 47, 253-262. | MR 121927 | Zbl 0094.15302

[10] A. Hadian, Optimality properties of various procedures for ranking n different numbers using only binary comparisons. Technical Report n°. 117, Departement of Statistics, Univ. of Minnesota, 1969.

[11] T. N. Hibbard, Some combinatorial properties of certain trees with application to searching and sorting. J. ACM, 1962, 9, 13-28. | MR 152155 | Zbl 0116.09410

[12] D. A. Huffman, A method for the Construction of Minimum redundancy codes. Proc. IRE, 1952, 9, 1098-1101.

[13] K. E. Iverson, A Programming Language. John Wiley and Sons, Inc., New York, 1962. | MR 143354 | Zbl 0101.34503

[14] S. S. Kislitsyne, On a bound for the smallest average number of pairwise comparisons necessary for a complete ordering of N objects with different weights (Russian). Vestnik Leningrad Univ. (Series on Math., Mech. and Astron.) 1962, 18, n°. 1, 162-163.

[15] S. S. Kislitsyne, A sharpening of the bound on the smallest average number of comparisons necessary for the complete ordering of a finite set (Russian). Vestnik Leningrad Univ. (Series on Math., Mech. and Astron.), 1963, 19, n° 4, 143-145 (MR 28, n°. 41).

[16] R. J. Maurice, Selection of the population with the largest mean when comparisons can be made only in pairs. Biometrika, 1958, 45, 581-586. | Zbl 0085.13701

[17] C. Picard, Théorie des Questionnaires. Gauthier-Villars, Paris, 1965 (MR 33, n° 7186). Voir aussi : Graphes et Questionnaires, Gauthier-Villars, Paris, 1972. | MR 199036 | Zbl 0128.39002

[18] M. Sandelius, On an Optimal Search Procedure. Amer. Math. Monthly, 1961, 68, 133-134. | MR 127425 | Zbl 0111.33403

[19] J. Schreier, On tournament elimination systems (Polish). Mathesis Polska, 1932, 7, 154-160. | JFM 58.1016.01

[20] J. Slupecki, On the system S of tournaments. Colloq. Math., 1949-51, 2, 286-290. | Zbl 0045.15204

[21] M. Sobel, Optimal Group-testing. Proceeedings of the Colloquium held in Debrecen on Information Theory 1967publiées par l'académie des Sciences de Hongrie, 441-448. | Zbl 0206.20401

[22] M. Sobel and P. A. Groll, Group-testing to eliminate efficiently all defectives in a binomial sample. Bell Syst. Techn. J., 1959, 38, 1179-1252. | MR 107341

[23] H. Steinhaus, Mathematical Snapshots, 1950 and 1960, Oxford Univ. Press, New York (see pp. 37-40 in the 1950 edition). | MR 36005 | Zbl 0041.27502

[24] H. Steinhaus, One Hundred Problems in Elementary Mathematics, 1958. (See Problems 52 and 85 in the 1963 edition, Pergamon Press, London.) | MR 90552 | Zbl 0116.24102

[25] H. Steinhaus, Some remarks about tournaments. Calcutta Math. Soc. Golden Jubilee Comm., 1959, Vol. Part II, 323-327 (MR 27, n°. 4770). | MR 154826 | Zbl 0121.15402