Automation of counting of the Preferential votes

Main Article Content

Rakesh Kumar Pandey

Abstract

This paper discusses the complexity involved in counting of preferential votes wherein the candidates are ranked by the voters. The process of counting passes through the rounds of distribution of surplus votes and votes of the eliminated candidates. It is shown theoretically that the counting has exponential time complexity. Thankfully, the manual counting does not require exploring all the possibilities. For such problems where automating the process theoretically involves complex iterations but relatively has easier manual solutions, an easier way will be to mix up manual and digital process in such a manner that the complete exercise gets tackled as efficiently as possible.

Downloads

Download data is not yet available.

Article Details

Section
Articles
Author Biography

Rakesh Kumar Pandey, Kirori Mal College, University of Delhi, Delhi - 11007

Associate Professor in Physics Department, Kirori Mal College

References

Ramesh R Marza, Assistant Professor,

Department of CS & IT, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad

Ganesh Raybhan Manza, Ph.D, Dr. Babasaheb Ambedkar Marathwada

University, Aurangabad