Applications
Ranking Abuse via Strategic Pairwise Data Perturbations
arXiv:2604.17805v1 Announce Type: new Abstract: Pairwise ranking systems based on Maximum Likelihood Estimation (MLE), such as the Bradley-Terry model, are widely used to aggregate preferences from pa
arXiv:2604.17805v1 Announce Type: new Abstract: Pairwise ranking systems based on Maximum Likelihood Estimation (MLE), such as the Bradley-Terry model, are widely used to aggregate preferences from pairwise comparisons. However, their robustness under strategic data manipulation remains insufficiently understood. In this paper, we study the vulnerability of MLE-based ranking systems to adversarial perturbations. We formulate the manipulation task as a constrained combinatorial optimization problem and propose an Adaptive Subset Selection Attack (ASSA) to efficiently identify high-impact perturbations. Experimental results on both synthetic data and real-world election datasets show that MLE-based rankings exhibit a sharp phase-transition behavior: beyond a small perturbation budget, a limited number of strategic voters can significantly alter the global ranking. In particular, our method consistently outperforms random and greedy baselines under constrained budgets. These findings reveal a fundamental sensitivity of MLE-based ranking mechanisms to structured perturbations and highlight the need for more robust aggregation methods in collective decision-making systems.
Related
- Covariance-Based Structural Equation Modeling in Small-Sample Settings with p>n
- Score-matching-based Structure Learning for Temporal Data on Networks
- Joint Score-Threshold Optimization for Interpretable Risk Assessment
- Random Walk Learning and the Pac-Man Attack
Source: arXiv cs.LG | 2026-04-21