Related papers: Election in India: Polling in National Financial Switch

Election in India: Polling in National Financial Switch

URL: http://arxiv.org/abs/2002.11619v1
Date: Sat, 15 Feb 2020 15:39:50 GMT
Title: Election in India: Polling in National Financial Switch
Authors: Subhankar Mishra
Abstract summary: 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.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Indian voters from Kashmir to Kanyakumari select their representatives to form their parliament by going to polls. India's election is one of the largest democratic exercise in the world history. About 850 million eligible voters determine which political party or alliance will form the government and in turn, will serve as prime minister. Given the electoral rules of placing a polling place within 2 kilometers of every habitation, it comes as no surprise that is indeed a humongous task for the Election Commission of India (ECI). It sends around 11 million election workers through tough terrains to reach the last mile. This exercise also comes as ever growing expenditure for the ECI. This paper proposes the use of Automated Teller Machines (ATM) and Point Of Sale (POS) machines to be used to cover as much as urban, rural and semi-urban places possible given the wide network of National Financial Switch (NFS) and increase in connectivity through Digital India initiative. This would add to the use of the existing infrastructure to accommodate a free, fair and transparent election.

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)
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)
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)
Design and analysis of tweet-based election models for the 2021 Mexican legislative election [55.41644538483948]
We use a dataset of 15 million election-related tweets in the six months preceding election day. We find that models using data with geographical attributes determine the results of the election with better precision and accuracy than conventional polling methods.
arXiv Detail & Related papers (2023-01-02T12:40:05Z)
An AI-Powered VVPAT Counter for Elections in India [0.0]
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.
arXiv Detail & Related papers (2022-12-09T14:59:40Z)
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)
Agent-based Simulation of District-based Elections [0.5076419064097732]
In district-based elections, electors cast votes in their respective districts. In each district, the party with maximum votes wins the corresponding seat in the governing body. The election result is based on the number of seats won by different parties.
arXiv Detail & Related papers (2022-05-28T11:19:04Z)
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)
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)
Persuading Voters in District-based Elections [41.17991144796081]
We focus on the scenario in which an agent can exploit his information advantage to manipulate the outcome of an election. We resort to the Bayesian persuasion framework, where the manipulator strategically discloses information to the voters. For the first time, we introduce semi-public signaling in which the sender can use a single communication channel per district.
arXiv Detail & Related papers (2020-12-09T12:23:01Z)
Electoral David vs Goliath: How does the Spatial Concentration of Electors affect District-based Elections? [0.5076419064097732]
district-based elections where there is a "seat" for each district in the governing body. In each district, the party whose candidate gets the maximum number of votes wins the corresponding seat. locations of the electors and boundaries of the districts may severely affect the election result even if the proportion of popular support of different parties remains unchanged. This has led to significant amount of research on whether the districts may be redrawn or electors may be moved to maximize seats for a particular party.
arXiv Detail & Related papers (2020-06-21T18:17:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.