Metric geometry for ranking-based voting: Tools for learning electoral structure

• URL: http://arxiv.org/abs/2602.10293v1
• Date: Tue, 10 Feb 2026 21:07:46 GMT
• Title: Metric geometry for ranking-based voting: Tools for learning electoral structure
• Authors: Moon Duchin, Kristopher Tapp,
• Abstract summary: We develop the metric geometry of ranking statistics, proving that the two major permutations in the statistics literature -- Kendall tau and Spearman footrule -- extend naturally to incomplete rankings.<n>As an important application, the metric structure enables efficient identification of blocs of voters and slates of their preferred candidates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we develop the metric geometry of ranking statistics, proving that the two major permutation distances in the statistics literature -- Kendall tau and Spearman footrule -- extend naturally to incomplete rankings with both coordinate embeddings and graph realizations. This gives us a unifying framework that allows us to connect popular topics in computational social choice: metric preferences (and metric distortion), polarization, and proportionality. As an important application, the metric structure enables efficient identification of blocs of voters and slates of their preferred candidates. Since the definitions work for partial ballots, we can execute the methods not only on synthetic elections, but on a suite of real-world elections. This gives us robust clustering methods that often produce an identical grouping of voters -- even though one family of methods is based on a Condorcet-consistent ranking rule while the other is not.

Related papers

• Optimized Distortion in Linear Social Choice [28.227695590829086]
  We study distortion of linear social choice for deterministic and randomized voting rules.<n>We introduce poly-time instance-optimal algorithms for minimizing distortion given a collection of candidates and votes.
  arXiv  Detail & Related papers  (2025-10-22T20:42:49Z)
• Latent Topic Synthesis: Leveraging LLMs for Electoral Ad Analysis [51.95395936342771]
  We introduce an end-to-end framework for automatically generating an interpretable topic taxonomy from an unlabeled corpus.<n>We apply this framework to a large corpus of Meta political ads from the month ahead of the 2024 U.S. Presidential election.<n>Our approach uncovers latent discourse structures, synthesizes semantically rich topic labels, and annotates topics with moral framing dimensions.
  arXiv  Detail & Related papers  (2025-10-16T20:30:20Z)
• Towards Two-Stage Counterfactual Learning to Rank [50.51916012823433]
  Counterfactual learning to rank aims to learn a ranking policy from user interactions.<n>In real-world applications, the candidate document set is on the order of millions, making a single-stage ranking policy impractical.<n>We propose a two-stage CLTR estimator that considers the interaction between the two stages and estimates the joint value of the two policies offline.
  arXiv  Detail & Related papers  (2025-06-25T22:00:12Z)
• Drawing a Map of Elections [53.92343633736932]
  A map of elections consists of three main elements: a dataset of elections, a way of measuring similarities between these elections, and a representation of the elections in the 2D Euclidean space as points.<n>We show how coloring the elections in a map according to various criteria helps in analyzing results of a number of experiments.
  arXiv  Detail & Related papers  (2025-04-04T11:44:56Z)
• Efficient Lower Bounding of Single Transferable Vote Election Margins [56.12949230611067]
  Single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections.<n>The margin of victory, or simply'margin', is the smallest number of ballots that need to be manipulated to alter the set of winners.<n>Lower bounds on the margin can also be used for this purpose, in cases where exact margins are difficult to compute.
  arXiv  Detail & Related papers  (2025-01-24T13:39:23Z)
• Data as voters: instance selection using approval-based multi-winner voting [1.597617022056624]
  We present a novel approach to the instance selection problem in machine learning (or data mining) In our model, instances play a double role as voters and candidates. For SVMs, we have obtained slight increases in the average accuracy by using several voting rules that satisfy EJR or PJR.
  arXiv  Detail & Related papers  (2023-04-19T22:00:23Z)
• Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning [58.23459346724491]
  We use the "map of elections" approach of Szufa et al. (AAMAS 2020) to analyze several well-known vote distributions. We draw the "skeleton map" of distributions, evaluate its robustness, and analyze its properties.
  arXiv  Detail & Related papers  (2022-05-16T17:40:22Z)
• Robust Voting Rules from Algorithmic Robust Statistics [25.313563663123354]
  We give an algorithm that can accurately estimate the central ranking even when a constant fraction of its samples are arbitrarily corrupted. Our work can be thought of as a natural infusion of perspectives from algorithmic robust statistics into one of the central inference problems in voting and information-aggregation.
  arXiv  Detail & Related papers  (2021-12-13T02:30:26Z)
• Estimation of Fair Ranking Metrics with Incomplete Judgments [70.37717864975387]
  We propose a sampling strategy and estimation technique for four fair ranking metrics. We formulate a robust and unbiased estimator which can operate even with very limited number of labeled items.
  arXiv  Detail & Related papers  (2021-08-11T10:57:00Z)
• Learning to Elect [7.893831644671976]
  Voting systems have a wide range of applications including recommender systems, web search, product design and elections. We show that set-input neural network architectures such as Set Transformers, fully-connected graph networks and DeepSets are both theoretically and empirically well-suited for learning voting rules.
  arXiv  Detail & Related papers  (2021-08-05T17:55:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.