The Influence of the Number of Voters on Ranking Data Sampled with the Mallows Model

Ranking aggregation algorithms are typically evaluated using synthetic data generated by the Mallows model. Comparisons are often made across profiles with varying numbers of voters under the assumption that their structural properties remain consistent. However, previous empirical studies have shown that this assumption does not always hold, as the number of voters appears to affect profile characteristics such as the Condorcet properties. In this paper, we provide a theoretical explanation of these phenomena by introducing a probabilistic framework that characterises events arising from the Mallows sampling process, including the probability that a given alternative is the Condorcet winner. We demonstrate that the number of voters influences the distribution of sampled profiles and, consequently, their structural characteristics. Building on these theoretical results, we propose methodological guidelines for the fair evaluation of ranking aggregation algorithms, facilitating unbiased comparisons across benchmark instances generated with different parameter configurations.

Authors

Institutions

Publication Details

Journal
International Journal of Computational Intelligence Systems
Published
2026-08-26
DOI
https://doi.org/10.1007/s44196-026-01514-6
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

The Influence of the Number of Voters on Ranking Data Sampled with the Mallows Model

Irene Dı́az, Noelia Rico, Juan Baz, Mario Villar
International Journal of Computational Intelligence Systems
Game Theory and Voting Systems
article

The Influence of the Number of Voters on Ranking Data Sampled with the Mallows Model

Irene Dı́az, Noelia Rico, Juan Baz, Mario Villar
article en

Abstract

Ranking aggregation algorithms are typically evaluated using synthetic data generated by the Mallows model. Comparisons are often made across profiles with varying numbers of voters under the assumption that their structural properties remain consistent. However, previous empirical studies have shown that this assumption does not always hold, as the number of voters appears to affect profile characteristics such as the Condorcet properties. In this paper, we provide a theoretical explanation of these phenomena by introducing a probabilistic framework that characterises events arising from the Mallows sampling process, including the probability that a given alternative is the Condorcet winner. We demonstrate that the number of voters influences the distribution of sampled profiles and, consequently, their structural characteristics. Building on these theoretical results, we propose methodological guidelines for the fair evaluation of ranking aggregation algorithms, facilitating unbiased comparisons across benchmark instances generated with different parameter configurations.

International Journal of Computational Intelligence Systems
Universidad de Oviedo (ES), Politecnico di Torino (IT)
Peace, Justice and strong institutions
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.