Diverse Representation via Computational Participatory Elections -- Lessons from a Case Study

• URL: http://arxiv.org/abs/2205.15394v1
• Date: Mon, 30 May 2022 19:22:38 GMT
• Title: Diverse Representation via Computational Participatory Elections -- Lessons from a Case Study
• Authors: Florian Ev\'equoz, Johan Rochel, Vijay Keswani, and L. Elisa Celis
• Abstract summary: 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.
• Score: 16.699381591572166
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Elections are the central institution of democratic processes, and often the elected body -- in either public or private governance -- is a committee of individuals. To ensure the legitimacy of elected bodies, the electoral processes should guarantee that diverse groups are represented, in particular members of groups that are marginalized due to gender, ethnicity, or other socially salient attributes. To address this challenge of representation, 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 flexibly 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, conditioned on satisfying the criteria provided in the first round. With the help of a detailed use case that applied this process in a primary election of 96 representatives in Switzerland, we explain how this method contributes to fairness in political elections by achieving a better "descriptive representation". Further, based on this use case, we identify lessons learnt that are applicable to participatory computational systems used in societal or political contexts. Good practices are identified and presented.

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)
• From Experts to the Public: Governing Multimodal Language Models in Politically Sensitive Video Analysis [48.14390493099495]
  This paper examines the governance of large language models (MM-LLMs) through individual and collective deliberation. We conducted a two-step study: first, interviews with 10 journalists established a baseline understanding of expert video interpretation; second, 114 individuals from the general public engaged in deliberation using Inclusive.AI.
  arXiv  Detail & Related papers  (2024-09-15T03:17:38Z)
• 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)
• Designing Digital Voting Systems for Citizens: Achieving Fairness and Legitimacy in Participatory Budgeting [10.977733942901535]
  Participatory Budgeting (PB) has evolved into a key democratic instrument for resource allocation in cities. This work presents the results of behavioural experiments where participants were asked to vote in a fictional PB setting. We identify approaches to designing PB voting that minimise cognitive load and enhance the perceived fairness and legitimacy of the digital process.
  arXiv  Detail & Related papers  (2023-10-05T12:25:48Z)
• Fair and Inclusive Participatory Budgeting: Voter Experience with Cumulative and Quadratic Voting Interfaces [1.4730691320093603]
  Cumulative and quadratic voting are expressive, promoting fairness and inclusion. Despite these benefits, graphical voter interfaces for cumulative and quadratic voting are complex to implement and use effectively. This paper introduces an implementation and evaluation of cumulative and quadratic voting within a state-of-the-art voting platform: Stanford Participatory Budgeting.
  arXiv  Detail & Related papers  (2023-08-08T15:45:55Z)
• 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)
• Pandering in a Flexible Representative Democracy [24.462078390546246]
  We examine the resilience of two democratic voting systems to pandering within a single round and across multiple rounds. For each voting system, our analysis centers on the types of strategies candidates employ and how voters update their views of candidates based on how the candidates have pandered in the past.
  arXiv  Detail & Related papers  (2022-11-18T02:19:28Z)
• 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)
• Exploring Fairness in District-based Multi-party Elections under different Voting Rules using Stochastic Simulations [0.5076419064097732]
  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.
  arXiv  Detail & Related papers  (2022-02-25T18:03:03Z)
• Unravelling multi-agent ranked delegations [6.434709790375755]
  We introduce a voting model with multi-agent ranked delegations. We study unravelling procedures that transform the delegation ballots received from the agents into a profile of direct votes.
  arXiv  Detail & Related papers  (2021-11-25T15:58:39Z)
• 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)

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.