Fair and Inclusive Participatory Budgeting: Voter Experience with Cumulative and Quadratic Voting Interfaces

• URL: http://arxiv.org/abs/2308.04345v2
• Date: Mon, 6 Nov 2023 11:29:46 GMT
• Title: Fair and Inclusive Participatory Budgeting: Voter Experience with Cumulative and Quadratic Voting Interfaces
• Authors: Thomas Wellings, Fatemeh Banaie Heravan, Abhinav Sharma, Lodewijk Gelauff, Regula H\"anggli Fricker, Evangelos Pournaras
• Abstract summary: 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.
• Score: 1.4730691320093603
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cumulative and quadratic voting are two distributional voting methods that are expressive, promoting fairness and inclusion, particularly in the realm of participatory budgeting. Despite these benefits, graphical voter interfaces for cumulative and quadratic voting are complex to implement and use effectively. As a result, such methods have not seen yet widespread adoption on digital voting platforms. This paper addresses the challenge by introducing an implementation and evaluation of cumulative and quadratic voting within a state-of-the-art voting platform: Stanford Participatory Budgeting. The findings of the study show that while voters prefer simple methods, the more expressive (and complex) cumulative voting becomes the preferred one compared to k-ranking voting that is simpler but less expressive. The implemented voting interface elements are found useful and support the observed voters' preferences for more expressive voting methods. *

Related papers

• 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)
• Employing Universal Voting Schemes for Improved Visual Place Recognition Performance [16.242139178368923]
  This paper analyses several voting schemes to maximise the place detection accuracy of a VPR ensemble set up. We take inspiration from a variety of voting schemes that are widely employed in fields such as politics and sociology.
  arXiv  Detail & Related papers  (2024-03-08T14:19:14Z)
• 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)
• Learning to Manipulate under Limited Information [44.99833362998488]
  We trained over 70,000 neural networks of 26 sizes to manipulate against 8 different voting methods. We find that some voting methods, such as Borda, are highly manipulable by networks with limited information, while others, such as Instant Runoff, are not.
  arXiv  Detail & Related papers  (2024-01-29T18:49:50Z)
• Rank, Pack, or Approve: Voting Methods in Participatory Budgeting [2.326556516716391]
  The Stanford Participatory Budgeting platform has been used to engage residents in more than 150 budgeting processes. We present a data set with anonymized budget opinions from these processes with K-approval, K-ranking or knapsack primary ballots. We use vote pairs with different voting methods to analyze the effect of voting methods on the cost of selected projects.
  arXiv  Detail & Related papers  (2024-01-23T01:19:44Z)
• 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)
• 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)
• VoteLab: A Modular and Adaptive Experimentation Platform for Online Collective Decision Making [0.9503786527351696]
  This paper introduces VoteLab, an open-source platform for modular and adaptive design of voting experiments. It supports to visually and interactively build reusable campaigns with a choice of different voting methods. Voters can easily respond to subscribed voting questions on a smartphone.
  arXiv  Detail & Related papers  (2023-07-20T14:26:21Z)
• Candidate Incentive Distributions: How voting methods shape electoral incentives [0.0]
  We find that Instant Runoff Voting incentivizes candidates to appeal to a wider range of voters than Plurality Voting. We find that Condorcet methods and STAR (Score Then Automatic Runoff) Voting provide the most balanced incentives.
  arXiv  Detail & Related papers  (2023-06-12T14:32:46Z)
• Private Multi-Winner Voting for Machine Learning [48.0093793427039]
  We propose three new DP multi-winner mechanisms: Binary, $tau$, and Powerset voting. Binary voting operates independently per label through composition. $tau$ voting bounds votes optimally in their $ell$ norm for tight data-independent guarantees. Powerset voting operates over the entire binary vector by viewing the possible outcomes as a power set.
  arXiv  Detail & Related papers  (2022-11-23T20:06:46Z)
• 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.