atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Distances Between Top-Truncated Elections of Different Sizes

AAAI 2025 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Extends the map-of-elections framework to elections of different sizes and top-truncated votes by proposing a positionwise extension (via Wasserstein distance) and a feature-based DAP distance, and uses DAP to map Preflib.

Problem

Map-of-elections visualizations were restricted to equal-sized, complete elections, so real-world elections with different candidate/voter counts and top-truncated votes (e.g., Preflib, Formula 1) could not be compared natively.

Approach

Define a positionwise extension using Wasserstein distance between stretched frequency matrices that handles different sizes and truncated votes natively, and a feature distance DAP built on diversity, agreement, and polarization indices that is ID- and AN-consistent; argue via axioms that no swap extension can satisfy ID-, AN-, and UN-consistency simultaneously.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use DAP distance rather than positionwise distance to compare same-culture elections with different candidate countsElection maps · Synthetic elections from the same culture with different candidate countsscaled distanceHelped
Use DAP distance rather than positionwise distance for top-k-truncated electionsElection maps · Top-k truncation; at least half of candidates rankednormalized distance from the complete election: less than 20% of the diameter; less than 5% of the diamaterHelped
Use DAP distance for elections truncated by random cut or random drop rather than positionwise distanceElection maps · Random cut and random drop truncationdistance from the complete electionNo clear effect
Use random drop truncationSynthetic elections · Random drop truncation with dropping probability 0.5map separation of generated electionsHurt

Surprising findings

Limitations

Experimental setup

Datasets: Preflib synthetic statistical cultures (IC, Mallows, urn, Euclidean, single-peaked, SPOC, group-separable)

Benchmarks: Preflib

Metrics: average normalized distance across sizes distance from complete to truncated elections axiom satisfaction (ID/AN/UN consistency, triangle inequalit

Baselines: isomorphic swap distance positionwise distance (EMD-based) truncated swap extension deleted swap extension

Builds on: isomorphic swap distance positionwise distance map of elections framework Kamada-Kawai embedding multidimensional scaling

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy