Solving hard control problems in voting systems via integer programming

Polyakovskiy, Sergey; Berghammer, Rudolf; Neumann, Franz‐Josef

doi:10.1016/j.ejor.2015.08.052

Cited by 8 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, a vote should not be traceable back to the voter in e-voting. E-voting uses computers, mobile devices, and internet to accomplish the whole vote procedure, which is a research field of cryptography with the basic of encryption and signature algorithms [12,15,16].…”

Section: Motivationsmentioning

confidence: 99%

Securing e-voting based on blockchain in P2P network

2019

J Wireless Com Network

116

View full text Add to dashboard Cite

Electronic voting (e-voting) is an electronic means for casting and counting votes. It is an efficient and cost-effective way for conducting a voting procedure, which has characteristic of being magnanimous data and real time and requesting high safety. However, concerns on security of networking and privacy of communication for e-voting have been grown. Securing e-voting is very urgent and has becoming a popular topic in the area of communications and networking. We present techniques to exploit blockchain in P2P network to improve the security of e-voting. First, we design a synchronized model of voting records based on distributed ledger technology (DLT) to avoid forgery of votes. Second, we design a user credential model based on elliptic curve cryptography (ECC) to provide authentication and non-repudiation. Third, we design a withdrawal model that allows voters to change their vote before a preset deadline. By integrating the above designs, a blockchain-based e-voting scheme in P2P network is proposed for essential requirements of e-voting process. To prove and verify the scheme, a blockchain-based e-voting system for multiple candidates has been designed on Linux platforms in P2P network. The system involves electronic voting theory, cryptography, and software engineering theory. The implementation result shows that it is a practical and secure e-voting system, which solves the problem on forgery of votes during e-voting. The blockchain-based e-voting system can be applied to a variety of networking applications directly.

show abstract

Section: Motivationsmentioning

confidence: 99%

Securing e-voting based on blockchain in P2P network

2019

J Wireless Com Network

116

View full text Add to dashboard Cite

show abstract

“…We first give a natural polynomial-time reduction of the possible winners to Integer Linear Programming (ILP) for all positional scoring rules. Note that ILP has been used in earlier research on the complexity of voting problems as a theoretical technique for proving upper bounds (fixed-parameter tractability) in the parameterized complexity of the possible winners [4,14,21] or in election manipulation problems involving complete preferences [17]. Here, we investigate the use of ILP solvers to compute the possible winners in practice.…”

Section: Introductionmentioning

confidence: 99%

Algorithmic Techniques for Necessary and Possible Winners

Chakraborty

Delemazure

Kimelfeld

et al. 2021

ACM/IMS Trans. Data Sci.

View full text Add to dashboard Cite

We investigate the practical aspects of computing the necessary and possible winners in elections over incomplete voter preferences. In the case of the necessary winners, we show how to implement and accelerate the polynomial-time algorithm of Xia and Conitzer. In the case of the possible winners, where the problem is NP-hard, we give a natural reduction to Integer Linear Programming (ILP) for all positional scoring rules and implement it in a leading commercial optimization solver. Further, we devise optimization techniques to minimize the number of ILP executions and, oftentimes, avoid them altogether. We conduct a thorough experimental study that includes the construction of a rich benchmark of election data based on real and synthetic data. Our findings suggest that, the worst-case intractability of the possible winners notwithstanding, the algorithmic techniques presented here scale well and can be used to compute the possible winners in realistic scenarios.

show abstract

“…According to Alam, Mezbahuddin, and Shoma (2015), in the earth, election is very much liking word. When a group of people with individual preferences has to decide which alternative to choose from a given set of alternatives, an election is often carried out (Polykovskiy, Berghammer, & Neumann, 2016). Therefore, obtaining a group ranking or a winning candidate from individual's preferences on a set of alternatives is an important group decision problem with social choice and voting system implications (Aghayi & Tavana, 2019).…”

Section: Introductionmentioning

confidence: 99%

Three New Models for Ranking of Candidates In the Preferential Voting Systems

Azadfallah¹

2021

IJMRSS

View full text Add to dashboard Cite

Election is the main challenge to the political and social science. In the meantime, in the literature, several methods to decide the winner of elections have been proposed; theoretically there is no reason to be limited to these models. Hence, in this paper, we assume three new approaches (1. election result prediction by pre-election preference information using Markov chain model [to identify the efficient electoral strategy for each candidate]. 2. Improved Borda’s function method using the weights of decision makers [or voters]. And 3. A new interval TOPSIS-based approach applying ordinal set of preferences [so, data is ordinal form that first convert to interval value and then inject them into the conventional interval TOPSIS model]) for ranking candidates in voting systems. Ultimately, three numerical examples in social choice context are given to depict the feasibility and practability of the proposed methods. In sum, this paper suggests a mind line for decreasing the wrong choice winner risks correlated with voting systems.

show abstract

Solving hard control problems in voting systems via integer programming

Cited by 8 publications

References 16 publications

Securing e-voting based on blockchain in P2P network

Securing e-voting based on blockchain in P2P network

Algorithmic Techniques for Necessary and Possible Winners

Three New Models for Ranking of Candidates In the Preferential Voting Systems

Contact Info

Product

Resources

About