We study voting models on graphs. In the beginning, the vertices of a given graph have some initial opinion. Over time, the opinions on the vertices change by interactions between graph neighbours. Under suitable conditions the system evolves to a state in which all vertices have the same opinion. In this work, we consider a new model of voting, called the Linear Voting Model. This model can be...

As cheating is an inherent threat to voting, it is essential that an e-voting system provides a high level of security. At the moment, commercially available e-voting solutions mainly advertise their convenience, efficiency and low cost. On the other hand, cryptographically secure voting schemes in the literature are generally considered to be complex and inefficient for a real-world implementa...

In recent years, enlargement of the European Union has led to increased interest in the allocation of voting weights to member states with hugely differing population numbers. While the eventually agreed voting scheme lacks any strict mathematical basis, the Polish government suggested a voting scheme based on the Penrose definition of voting power, leading to an allocation of voting weights pr...

The Open Voting Consortium has a developed a prototype voting system with a modular voting architecture that includes an open source, PC-based voting machine that prints an accessible, voter-verified paper ballot along with an electronic audit trail. This system was designed for reliability, security, privacy, accessibility and auditability. This paper describes some of the privacy consideratio...

This paper gives an overview about the Estonian e-voting system. Paper discusses how the concept of e-voting system is designed to resist some of the main challenges of remote e-voting: secure voters authentication, assurance of privacy of voters, giving the possibility of re-vote, and how an e-voting system can be made comprehensible to build the public trust.

We consider a committee facing a binary decision under uncertainty. Each member holds some private information. Members may have different preferences and initial beliefs, but they all agree which decision should be taken in each of the two states of the world. We characterize the optimal anonymous and deterministic voting rule and provide a homogeneity assumption on preferences and beliefs und...

We investigate systems of indirect voting based on the law of Penrose, in which each representative in the voting body receives the number of votes (voting weight) proportional to the square root of the population he or she represents. For a generic population distribution, the quota required for the qualified majority can be set in such a way that the voting power of any state is proportional ...

The secure remote Internet voting protocol play an important role in Internet voting system. The direction of development of remote Internet voting protocol is that implementation of receipt-freeness and coercion-resistance is from with strong physical assumptions to with weak physical assumptions. The final purpose is that receiptfreeness and coercion-resistance is implemented without physical...

Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...

Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...