Drawing a Map of Elections

• URL: http://arxiv.org/abs/2504.03809v2
• Date: Tue, 08 Apr 2025 10:52:54 GMT
• Title: Drawing a Map of Elections
• Authors: Stanisław Szufa, Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon,
• Abstract summary: 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.
• Score: 53.92343633736932
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of ordinal votes over given sets of candidates), (2) a way of measuring similarities between these elections, and (3) a representation of the elections in the 2D Euclidean space as points, so that the more similar two elections are, the closer are their points. In our maps, we mostly focus on datasets of synthetic elections, but we also show an example of a map over real-life ones. To measure similarities, we would have preferred to use, e.g., the isomorphic swap distance, but this is infeasible due to its high computational complexity. Hence, we propose polynomial-time computable positionwise distance and use it instead. Regarding the representations in 2D Euclidean space, we mostly use the Kamada-Kawai algorithm, but we also show two alternatives. We develop the necessary theoretical results to form our maps and argue experimentally that they are accurate and credible. Further, we show how coloring the elections in a map according to various criteria helps in analyzing results of a number of experiments. In particular, we show colorings according to the scores of winning candidates or committees, running times of ILP-based winner determination algorithms, and approximation ratios achieved by particular algorithms.

Related papers

• 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)
• Representation Bias in Political Sample Simulations with Large Language Models [54.48283690603358]
  This study seeks to identify and quantify biases in simulating political samples with Large Language Models. Using the GPT-3.5-Turbo model, we leverage data from the American National Election Studies, German Longitudinal Election Study, Zuobiao dataset, and China Family Panel Studies.
  arXiv  Detail & Related papers  (2024-07-16T05:52:26Z)
• Ahead of the Count: An Algorithm for Probabilistic Prediction of Instant Runoff (IRV) Elections [0.0]
  We introduce a novel algorithm designed to predict outcomes in Instant Runoff Voting (IRV) elections. The algorithm takes as input a set of discrete probability distributions describing vote totals for each candidate ranking. We calculate all possible sequences of eliminations that might occur in the IRV rounds and assign a probability to each.
  arXiv  Detail & Related papers  (2024-05-15T00:25:51Z)
• 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)
• Agent-based Simulation of District-based Elections [0.5076419064097732]
  In district-based elections, electors cast votes in their respective districts. In each district, the party with maximum votes wins the corresponding seat in the governing body. The election result is based on the number of seats won by different parties.
  arXiv  Detail & Related papers  (2022-05-28T11:19:04Z)
• 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)
• Implications of Distance over Redistricting Maps: Central and Outlier Maps [10.318010762465939]
  In representative democracy, a redistricting map is chosen to partition an electorate into districts which each elects a representative.<n>A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous, and of almost-equal population.<n>This enables a partisan legislature to gerrymander by choosing a map which unfairly favors it.
  arXiv  Detail & Related papers  (2022-03-02T04:59:30Z)
• Rethinking Counting and Localization in Crowds:A Purely Point-Based Framework [59.578339075658995]
  We propose a purely point-based framework for joint crowd counting and individual localization. We design an intuitive solution under this framework, which is called Point to Point Network (P2PNet)
  arXiv  Detail & Related papers  (2021-07-27T11:41:50Z)
• Gravitational Models Explain Shifts on Human Visual Attention [80.76475913429357]
  Visual attention refers to the human brain's ability to select relevant sensory information for preferential processing. Various methods to estimate saliency have been proposed in the last three decades. We propose a gravitational model (GRAV) to describe the attentional shifts.
  arXiv  Detail & Related papers  (2020-09-15T10:12:41Z)
• Electoral David vs Goliath: How does the Spatial Concentration of Electors affect District-based Elections? [0.5076419064097732]
  district-based elections where there is a "seat" for each district in the governing body. In each district, the party whose candidate gets the maximum number of votes wins the corresponding seat. locations of the electors and boundaries of the districts may severely affect the election result even if the proportion of popular support of different parties remains unchanged. This has led to significant amount of research on whether the districts may be redrawn or electors may be moved to maximize seats for a particular party.
  arXiv  Detail & Related papers  (2020-06-21T18:17:57Z)

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.