Artificial Delegates Resolve Fairness Issues in Perpetual Voting with Partial Turnout

• URL: http://arxiv.org/abs/2506.21186v1
• Date: Thu, 26 Jun 2025 12:44:50 GMT
• Title: Artificial Delegates Resolve Fairness Issues in Perpetual Voting with Partial Turnout
• Authors: Apurva Shah, Axel Abels, Ann Nowé, Tom Lenaerts,
• Abstract summary: We study the integration of Artificial Delegates, preference-learning agents trained to represent absent voters, into perpetual voting systems.<n>Our findings indicate that while absenteeism significantly affects fairness, Artificial Delegates reliably mitigate these effects and enhance robustness across diverse scenarios.
• Score: 4.734824660843963
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Perpetual voting addresses fairness in sequential collective decision-making by evaluating representational equity over time. However, existing perpetual voting rules rely on full participation and complete approval information, assumptions that rarely hold in practice, where partial turnout is the norm. In this work, we study the integration of Artificial Delegates, preference-learning agents trained to represent absent voters, into perpetual voting systems. We examine how absenteeism affects fairness and representativeness under various voting methods and evaluate the extent to which Artificial Delegates can compensate for missing participation. Our findings indicate that while absenteeism significantly affects fairness, Artificial Delegates reliably mitigate these effects and enhance robustness across diverse scenarios.

Related papers

• Proportionality in Thumbs Up and Down Voting [20.84797796151438]
  We propose two conceptually distinct approaches to interpret proportionality in the presence of up and down votes.<n>The first approach treats the satisfaction from electing candidates as comparable, leading to combined proportionality guarantees.<n>The second approach considers veto power separately, introducing guarantees distinct from traditional proportionality.
  arXiv  Detail & Related papers  (2025-03-03T19:02:37Z)
• Verifying Proportionality in Temporal Voting [29.69443607539022]
  We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates.<n>We focus on the complexity of verifying whether a given outcome offers proportional representation.
  arXiv  Detail & Related papers  (2025-02-09T16:30:34Z)
• Optimal bounds for dissatisfaction in perpetual voting [84.02572742131521]
  We consider a perpetual approval voting method that guarantees that no voter is dissatisfied too many times.<n>We identify a sufficient condition on voter behavior under which a sublinear growth of dissatisfaction is possible.<n>We present a voting method with sublinear guarantees on dissatisfaction under bounded conflicts, based on the standard techniques from prediction with expert advice.
  arXiv  Detail & Related papers  (2024-12-20T19:58:55Z)
• Aligning AI with Public Values: Deliberation and Decision-Making for Governing Multimodal LLMs in Political Video Analysis [48.14390493099495]
  How AI models should deal with political topics has been discussed, but it remains challenging and requires better governance.<n>This paper examines the governance of large language models through individual and collective deliberation, focusing on politically sensitive videos.
  arXiv  Detail & Related papers  (2024-09-15T03:17:38Z)
• Generative AI Voting: Fair Collective Choice is Resilient to LLM Biases and Inconsistencies [21.444936180683147]
  We show that complex preferential ballot formats exhibit significant inconsistencies compared to simpler majoritarian elections.<n>Strikingly though, by demonstrating for the first time in real-world a proportional representation of voters in direct democracy, we are also able to show that fair ballot aggregation methods, such as equal shares, prove to be a win-win.
  arXiv  Detail & Related papers  (2024-05-31T01:41:48Z)
• The Decisive Power of Indecision: Low-Variance Risk-Limiting Audits and Election Contestation via Marginal Mark Recording [51.82772358241505]
  Risk-limiting audits (RLAs) are techniques for verifying the outcomes of large elections. We define new families of audits that improve efficiency and offer advances in statistical power. New audits are enabled by revisiting the standard notion of a cast-vote record so that it can declare multiple possible mark interpretations.
  arXiv  Detail & Related papers  (2024-02-09T16:23:54Z)
• As Time Goes By: Adding a Temporal Dimension Towards Resolving Delegations in Liquid Democracy [16.219158909792256]
  Our work takes a first step to integrate a time horizon into decision-making problems in Liquid Democracy systems. Our approach, via a computational complexity analysis, exploits concepts and tools from temporal graph theory.
  arXiv  Detail & Related papers  (2023-07-24T15:46:45Z)
• On Disentangled and Locally Fair Representations [95.6635227371479]
  We study the problem of performing classification in a manner that is fair for sensitive groups, such as race and gender. We learn a locally fair representation, such that, under the learned representation, the neighborhood of each sample is balanced in terms of the sensitive attribute.
  arXiv  Detail & Related papers  (2022-05-05T14:26:50Z)
• Full Characterization of Adaptively Strong Majority Voting in Crowdsourcing [0.5831737970661138]
  In crowdsourcing, quality control is commonly achieved by having workers examine items and vote on their correctness. To minimize the impact of unreliable worker responses, a $delta$-margin voting process is utilized. Our research presents a modeling approach using absorbing Markov chains to analyze the characteristics of this voting process.
  arXiv  Detail & Related papers  (2021-11-11T18:58:09Z)
• Mundus vult decipi, ergo decipiatur: Visual Communication of Uncertainty in Election Polls [56.8172499765118]
  We discuss potential sources of bias in nowcasting and forecasting. Concepts are presented to attenuate the issue of falsely perceived accuracy. One key idea is the use of Probabilities of Events instead of party shares.
  arXiv  Detail & Related papers  (2021-04-28T07:02:24Z)
• Fairness by Learning Orthogonal Disentangled Representations [50.82638766862974]
  We propose a novel disentanglement approach to invariant representation problem. We enforce the meaningful representation to be agnostic to sensitive information by entropy. The proposed approach is evaluated on five publicly available datasets.
  arXiv  Detail & Related papers  (2020-03-12T11:09:15Z)

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.