Optimal Item Placement for Information Retrieval in Stochastic Paired Comparison Models Under Special Comparison Structures

Paired comparison models are examined from the perspective of the placement of objects within specific comparison structures. For both pairwise comparison matrix-based models and stochastic models, previous studies have examined which comparison structures maximize the amount of information that can be recovered from incomplete comparisons. In this paper, we investigate how the amount of extracted information can be increased in stochastic paired comparison models—primarily the Bradley–Terry model—by way of exploiting prior information about the ranking of the objects, if such information is available. We examine several comparison structures to identify the optimal placement of objects within each structure with respect to information recovery and evaluability. The investigated structures are the star graph, the union of two star graphs, and the union of two edge-disjoint spanning trees. Parameters are estimated using the maximum likelihood method. The applied evaluation metrics are the Euclidean distance, Pearson, Spearman, and Kendall correlations, called similarity metrics. Moreover, the rate of evaluable datasets and an inconsistency index is also computed. We found that, in almost all cases, all four similarity metrics identified the same placement as optimal. Our results show that, for the star graph, placing an object of medium strength at the center and comparing all other object to it maximizes the amount of information recovered from the comparisons. For the union of two star graphs, placing objects that occupy middle positions in the ranking at the centers also outperforms the commonly used best–worst centered placement. However, the union of two edge-disjoint spanning trees provides, on average, even better information recovery based on all investigated metrics. We also examined the proportion of evaluable datasets and found it to be higher when medium-strength objects were placed at the centers. Finally, we compared the findings obtained from the stochastic models with those from pairwise comparison matrix-based models and observed strong agreement between the two approaches.

Authors

Institutions

Publication Details

Journal
Modelling—International Open Access Journal of Modelling in Engineering Science
Published
2026-08-14
DOI
https://doi.org/10.3390/modelling7040167
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Item Placement for Information Retrieval in Stochastic Paired Comparison Models Under Special Comparison Structures

Éva Orbán-Mihálykó, Csaba Mihálykó, László Gyarmati
Modelling—International Open Access Journal of Modelling in Engineering Science
Game Theory and Voting Systems
article

Optimal Item Placement for Information Retrieval in Stochastic Paired Comparison Models Under Special Comparison Structures

Éva Orbán-Mihálykó, Csaba Mihálykó, László Gyarmati
article en

Abstract

Paired comparison models are examined from the perspective of the placement of objects within specific comparison structures. For both pairwise comparison matrix-based models and stochastic models, previous studies have examined which comparison structures maximize the amount of information that can be recovered from incomplete comparisons. In this paper, we investigate how the amount of extracted information can be increased in stochastic paired comparison models—primarily the Bradley–Terry model—by way of exploiting prior information about the ranking of the objects, if such information is available. We examine several comparison structures to identify the optimal placement of objects within each structure with respect to information recovery and evaluability. The investigated structures are the star graph, the union of two star graphs, and the union of two edge-disjoint spanning trees. Parameters are estimated using the maximum likelihood method. The applied evaluation metrics are the Euclidean distance, Pearson, Spearman, and Kendall correlations, called similarity metrics. Moreover, the rate of evaluable datasets and an inconsistency index is also computed. We found that, in almost all cases, all four similarity metrics identified the same placement as optimal. Our results show that, for the star graph, placing an object of medium strength at the center and comparing all other object to it maximizes the amount of information recovered from the comparisons. For the union of two star graphs, placing objects that occupy middle positions in the ranking at the centers also outperforms the commonly used best–worst centered placement. However, the union of two edge-disjoint spanning trees provides, on average, even better information recovery based on all investigated metrics. We also examined the proportion of evaluable datasets and found it to be higher when medium-strength objects were placed at the centers. Finally, we compared the findings obtained from the stochastic models with those from pairwise comparison matrix-based models and observed strong agreement between the two approaches.

Modelling—International Open Access Journal of Modelling in Engineering ScienceVol. 7(4)
University of Pannonia (HU)
Openalex Percentile: Top 5%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.