Framework of Voting Prediction of Parliament Members

• URL: http://arxiv.org/abs/2505.12535v1
• Date: Sun, 18 May 2025 20:26:55 GMT
• Title: Framework of Voting Prediction of Parliament Members
• Authors: Zahi Mizrahi, Shai Berkovitz, Nimrod Talmon, Michael Fire,
• Abstract summary: Voting Prediction Framework (VPF) is a data-driven framework designed to forecast parliamentary voting outcomes at the individual legislator level and for entire bills.<n>VPF consists of three key components: Data Collection, Parsing and Feature Integration, and Prediction Models.<n>To evaluate VPF, we analyzed over 5 million voting records from five countries - Canada, Israel, Tunisia, the United Kingdom and the USA.
• Score: 9.050557698554694
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Keeping track of how lawmakers vote is essential for government transparency. While many parliamentary voting records are available online, they are often difficult to interpret, making it challenging to understand legislative behavior across parliaments and predict voting outcomes. Accurate prediction of votes has several potential benefits, from simplifying parliamentary work by filtering out bills with a low chance of passing to refining proposed legislation to increase its likelihood of approval. In this study, we leverage advanced machine learning and data analysis techniques to develop a comprehensive framework for predicting parliamentary voting outcomes across multiple legislatures. We introduce the Voting Prediction Framework (VPF) - a data-driven framework designed to forecast parliamentary voting outcomes at the individual legislator level and for entire bills. VPF consists of three key components: (1) Data Collection - gathering parliamentary voting records from multiple countries using APIs, web crawlers, and structured databases; (2) Parsing and Feature Integration - processing and enriching the data with meaningful features, such as legislator seniority, and content-based characteristics of a given bill; and (3) Prediction Models - using machine learning to forecast how each parliament member will vote and whether a bill is likely to pass. The framework will be open source, enabling anyone to use or modify the framework. To evaluate VPF, we analyzed over 5 million voting records from five countries - Canada, Israel, Tunisia, the United Kingdom and the USA. Our results show that VPF achieves up to 85% precision in predicting individual votes and up to 84% accuracy in predicting overall bill outcomes. These findings highlight VPF's potential as a valuable tool for political analysis, policy research, and enhancing public access to legislative decision-making.

Related papers

• Persona-driven Simulation of Voting Behavior in the European Parliament with Large Language Models [1.7990260056064977]
  We analyze whether zero-shot persona prompting with limited information can accurately predict individual voting decisions.<n>We find that we can simulate voting behavior of Members of the European Parliament reasonably well with a weighted F1 score of approximately 0.793.
  arXiv  Detail & Related papers  (2025-06-13T14:02:21Z)
• Political Actor Agent: Simulating Legislative System for Roll Call Votes Prediction with Large Language Models [9.0463587094323]
  Political Actor Agent (PAA) is a novel framework that utilizes Large Language Models to overcome limitations.<n>By employing role-playing architectures and simulating legislative system, PAA provides a scalable and interpretable paradigm for predicting roll-call votes.<n>We conducted comprehensive experiments using voting records from the 117-118th U.S. House of Representatives, validating the superior performance and interpretability of PAA.
  arXiv  Detail & Related papers  (2024-12-10T03:06:28Z)
• 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)
• Publicly auditable privacy-preserving electoral rolls [0.32498796510544625]
  We study the problem of designing publicly auditable yet privacy-preserving electoral rolls. The audit can detect polling-day ballot stuffing and denials to eligible voters by malicious polling officers. The entire electoral roll is never revealed, which prevents any large-scale systematic voter targeting and manipulation.
  arXiv  Detail & Related papers  (2024-02-18T13:11:48Z)
• 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)
• DeepParliament: A Legal domain Benchmark & Dataset for Parliament Bills Prediction [0.0]
  This paper introduces DeepParliament, a legal domain Benchmark dataset that gathers bill documents and metadata. We propose two new benchmarks: Binary and Multi-Class Bill Status classification. This work will be the first to present a Parliament bill prediction task.
  arXiv  Detail & Related papers  (2022-11-15T04:55:32Z)
• Election of government ministers [0.0]
  We propose a scenario where government members are directly elected by the people. In this article, we will present the implementation of the algorithm (GreedyPAV) proposed by Rutvik Page, Ehud Shapiro, and Nimrod Talmon.
  arXiv  Detail & Related papers  (2022-10-13T07:26:38Z)
• Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules [5.156484100374059]
  One of the main challenges in e-voting systems is to certify that the computed results are consistent with the cast ballots. We propose a secure voting protocol for elections governed by order-based voting rules. Our protocol offers perfect ballot secrecy, in the sense that it issues only the required output, while no other information on the cast ballots is revealed.
  arXiv  Detail & Related papers  (2022-05-21T12:17:21Z)
• German Parliamentary Corpus (GerParCor) [63.17616047204443]
  We introduce the German Parliament Corpus (GerParCor) GerParCor is a genre-specific corpus of German-language parliamentary protocols from three centuries and four countries. All protocols were preprocessed by means of the NLP pipeline of spaCy3 and automatically annotated with metadata regarding their session date.
  arXiv  Detail & Related papers  (2022-04-21T22:06:55Z)
• A Survey on Legal Judgment Prediction: Datasets, Metrics, Models and Challenges [73.34944216896837]
  Legal judgment prediction (LJP) applies Natural Language Processing (NLP) techniques to predict judgment results based on fact descriptions automatically. We analyze 31 LJP datasets in 6 languages, present their construction process and define a classification method of LJP. We show the state-of-art results for 8 representative datasets from different court cases and discuss the open challenges.
  arXiv  Detail & Related papers  (2022-04-11T04:06:28Z)

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.