Exploring Fairness in District-based Multi-party Elections under different Voting Rules using Stochastic Simulations

• URL: http://arxiv.org/abs/2203.03720v1
• Date: Fri, 25 Feb 2022 18:03:03 GMT
• Title: Exploring Fairness in District-based Multi-party Elections under different Voting Rules using Stochastic Simulations
• Authors: Adway Mitra
• Abstract summary: Many democratic societies use district-based elections, where the region under consideration is geographically divided into districts and a representative is chosen for each district based on the preferences of the electors who reside there. We show that this can lead to situations where many electors are dissatisfied with the election results, which is not desirable in a democracy. Inspired by current literature on fairness of Machine Learning algorithms, we define measures of fairness to quantify the satisfaction of electors, irrespective of their political choices.
• Score: 0.5076419064097732
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many democratic societies use district-based elections, where the region under consideration is geographically divided into districts and a representative is chosen for each district based on the preferences of the electors who reside there. These representatives belong to political parties, and the executive powers are acquired by that party which has a majority of the elected district representatives. In most systems, each elector can express preference for one candidate, though they may have a complete or partial ranking of the candidates/parties. We show that this can lead to situations where many electors are dissatisfied with the election results, which is not desirable in a democracy. The results may be biased towards the supporters of a particular party, and against others. Inspired by current literature on fairness of Machine Learning algorithms, we define measures of fairness to quantify the satisfaction of electors, irrespective of their political choices. We also consider alternative election policies using concepts of voting rules and rank aggregation, to enable voters to express their detailed preferences without making the electoral process cumbersome or opaque. We then evaluate these policies using the aforementioned fairness measures with the help of Monte Carlo simulations. Such simulations are obtained using a proposed stochastic model for election simulation, that takes into account community identities of electors and its role in influencing their residence and political preferences. We show that this model can simulate actual multi-party elections in India. Through extensive simulations, we find that allowing voters to provide 2 preferences reduces the disparity between supporters of different parties in terms of the election result.

Related papers

• ElectionSim: Massive Population Election Simulation Powered by Large Language Model Driven Agents [70.17229548653852]
  We introduce ElectionSim, an innovative election simulation framework based on large language models. We present a million-level voter pool sampled from social media platforms to support accurate individual simulation. We also introduce PPE, a poll-based presidential election benchmark to assess the performance of our framework under the U.S. presidential election scenario.
  arXiv  Detail & Related papers  (2024-10-28T05:25:50Z)
• 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)
• Efficient Weighting Schemes for Auditing Instant-Runoff Voting Elections [57.67176250198289]
  AWAIRE involves adaptively weighted averages of test statistics, essentially "learning" an effective set of hypotheses to test. We explore schemes and settings more extensively, to identify and recommend efficient choices for practice. A limitation of the current AWAIRE implementation is its restriction to a small number of candidates.
  arXiv  Detail & Related papers  (2024-02-18T10:13:01Z)
• Adaptively Weighted Audits of Instant-Runoff Voting Elections: AWAIRE [61.872917066847855]
  Methods for auditing instant-runoff voting (IRV) elections are either not risk-limiting or require cast vote records (CVRs), the voting system's electronic record of the votes on each ballot. We develop an RLA method that uses adaptively weighted averages of test supermartingales to efficiently audit IRV elections when CVRs are not available.
  arXiv  Detail & Related papers  (2023-07-20T15:55:34Z)
• Diverse Representation via Computational Participatory Elections -- Lessons from a Case Study [16.699381591572166]
  We have designed a novel participatory electoral process coined the Representation Pact, implemented with the support of a computational system. That process explicitly enables voters to decide on representation criteria in a first round, and then lets them vote for candidates in a second round. After the two rounds, a counting method is applied, which selects the committee of candidates that maximizes the number of votes received in the second round.
  arXiv  Detail & Related papers  (2022-05-30T19:22:38Z)
• 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)
• Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules [58.8640284079665]
  We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) We consider a number of approval-based multiwinner rules (AV, SAV, GAV, RAV, approval-based Chamberlin--Courant, and PAV) In general, our problems tend to be easier when we limit out bribery actions on increasing the number of approvals of the candidate that we want to be in a winning committee.
  arXiv  Detail & Related papers  (2021-04-19T08:26:40Z)
• Modeling Voters in Multi-Winner Approval Voting [24.002910959494923]
  We study voting behavior in single-winner and multi-winner approval voting scenarios with varying degrees of uncertainty. We find that people generally manipulate their vote to obtain a better outcome, but often do not identify the optimal manipulation. We propose a novel model that takes into account the size of the winning set and human cognitive constraints.
  arXiv  Detail & Related papers  (2020-12-04T19:24:28Z)
• 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.