An AI-Powered VVPAT Counter for Elections in India

• URL: http://arxiv.org/abs/2212.11124v1
• Date: Fri, 9 Dec 2022 14:59:40 GMT
• Title: An AI-Powered VVPAT Counter for Elections in India
• Authors: Prasath Murugesan, Shamshu Dharwez Saganvali
• Abstract summary: We propose an automated counter powered by image processing and machine learning algorithms to speed up the process. The time required to conduct physical verification becomes a bottleneck in scaling this activity for 100% of machines in all constituencies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Election Commission of India has introduced Voter Verified Paper Audit Trail since 2019. This mechanism has increased voter confidence at the time of casting the votes. However, physical verification of the VVPATs against the party level counts from the EVMs is done only in 5 (randomly selected) machines per constituency. The time required to conduct physical verification becomes a bottleneck in scaling this activity for 100% of machines in all constituencies. We proposed an automated counter powered by image processing and machine learning algorithms to speed up the process and address this issue.

Related papers

• Idiosyncratic properties of Australian STV election counting [52.669205232251585]
  Single Transferable Vote (STV) counting is used in several jurisdictions in Australia. This paper shows some of the unintuitive properties of some of these systems.
  arXiv  Detail & Related papers  (2024-09-18T01:19:27Z)
• Deceptive uses of Artificial Intelligence in elections strengthen support for AI ban [44.99833362998488]
  We propose a framework for assessing AI's impact on elections. We group AI-enabled campaigning uses into three categories -- campaign operations, voter outreach, and deception. We provide the first systematic evidence from a preregistered representative survey.
  arXiv  Detail & Related papers  (2024-08-08T12:58:20Z)
• Improving the Computational Efficiency of Adaptive Audits of IRV Elections [54.427049258408424]
  AWAIRE can audit IRV contests with any number of candidates, but the original implementation incurred memory and computation costs that grew superexponentially with the number of candidates. This paper improves the algorithmic implementation of AWAIRE in three ways that make it practical to audit IRV contests with 55 candidates, compared to the previous 6 candidates.
  arXiv  Detail & Related papers  (2024-07-23T13:28:00Z)
• 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)
• Improving the Security of United States Elections with Robust Optimization [5.454428371457422]
  We introduce the first formal approach to designing test decks with rigorous security guarantees. Our approach has since been piloted in real-world elections by the Michigan Bureau of Elections.
  arXiv  Detail & Related papers  (2023-08-04T13:17:53Z)
• 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)
• Identifying Possible Winners in Ranked Choice Voting Elections with Outstanding Ballots [0.0]
  ranked-choice voting (RCV) allows voters to rank their choices, and the results are computed in rounds. RCV election outcomes are not always apparent on election night, and can take several weeks to be published. We present an algorithm for efficiently computing possible winners of RCV elections from partially known ballots.
  arXiv  Detail & Related papers  (2022-06-25T22:08:15Z)
• 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)
• 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)
• A First Approach to Risk-Limiting Audits for Single Transferable Vote Elections [27.102139020324678]
  Risk-limiting audits (RLAs) are an increasingly important method for checking that the reported outcome of an election is, in fact, correct. This paper presents the first approach to risk-limiting audits for single transferable vote (STV) elections.
  arXiv  Detail & Related papers  (2021-12-18T12:36:39Z)
• Election in India: Polling in National Financial Switch [0.0]
  India's election is one of the largest democratic exercise in the world history. About 850 million eligible voters determine which political party will form the government and in turn, will serve as prime minister. This paper proposes the use of Automated Teller Machines (ATM) and Point Of Sale (POS) machines to cover as much as urban, rural and semi-urban places possible.
  arXiv  Detail & Related papers  (2020-02-15T15:39:50Z)

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.