Robustness of the ordering procedures based on binary-type questions and on pairwise comparisons (Q796195)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Robustness of the ordering procedures based on binary-type questions and on pairwise comparisons |
scientific article; zbMATH DE number 3864280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robustness of the ordering procedures based on binary-type questions and on pairwise comparisons |
scientific article; zbMATH DE number 3864280 |
Statements
Robustness of the ordering procedures based on binary-type questions and on pairwise comparisons (English)
0 references
1984
0 references
complete ordering
0 references
least favorable configuration
0 references
search for the largest
0 references
binary-type questions
0 references
robustness
0 references
probability of correct selection
0 references
asymptotic results
0 references
pairwise comparison procedures
0 references
0.7300498485565186
0 references
0.7055768370628357
0 references
0.702086865901947
0 references
