We consider a voting setting where candidates have preferences about the outcome of the election and are free to join or leave the election. The corresponding candidacy game, where candidates choose strategically to participate or not, has been studied by Dutta et al. [6], who showed that no non-dictatorial voting procedure satisfying unanimity is candidacy-strategyproof, that is, is such that ...

In order to model maliciously resizing election districts (a.k.a. gerrymandering), Bartholdi et al. [2] introduced control by partition of voters, which means that an election chair can influence the outcome of an election to her advantage by partitioning the voters such that two first-round subelections are created whose winners will take part in a final run-off. Control by partition of voter ...

Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network ...

This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...

Risk-limiting post-election audits guarantee a high probability of correcting incorrect electoral outcomes, regardless of why the outcomes are incorrect. Two types of risk-limiting post-election vote tabulation audits are comparison audits and ballot-polling audits. Comparison audits check some of the subtotals reported by the vote tabulation system, by hand-counting votes on the corresponding ...

In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Protocols proceed in rounds: though players are synchronized between rounds, within each round the...

To prevent bribery and coercion attacks on voters, current online election schemes rely on strong physical assumptions during the election. We introduce Masked Ballot, an online voting scheme that mitigates these attacks while using a more practical assumption: untappable channels are available but only before the election. During the election voters cast ballots over completely public channels...

Do individuals believe that an election victory by their favored candidate will improve their personal economic well-being? Previous work has either adopted an approach that is not well suited to determining this relationship, or ignored this question to focus on perceptions of macroeconomic conditions. In this paper we adopt a new approach that allows us to determine the relationship individua...

Anticipating the political behavior of people will be considerable help for election candidates to assess the possibility of their success and to be acknowledged about the public motivations to select them. In this paper, we provide a general schematic of the architecture of participation anticipating system in presidential election by using KNN, Classification Tree and Naïve Bayes and tools or...

Today’s world is all about Technology, Time is money becomes the equation. The advancement in the mobile devices, wireless and web technologies given rise to the new application that will make the voting process very easy and efficient. The e-voting promising the possibility of convenient, easy and safe way to capture and count the votes in an election. This paper provides the specification and...