Related papers: From a toy model to the double square root voting …
Election data represent a precious source of information to study human behavior at a large scale. In proportional elections with open lists, the number of votes received by a candidate, rescaled by the average performance of all…
We introduce a general methodology of update rules accounting for arbitrary interevent time distributions in simulations of interacting agents. In particular we consider update rules that depend on the state of the agent, so that the update…
Many binary collective choice situations can be described as weighted simple voting games. We introduce weighted committee games to model decisions on an arbitrary number of alternatives in analogous fashion. We compare the effect of…
We consider a coupled Polya's urn scheme for social dynamics on networks. Agents hold continuum-valued opinions on a two-state issue and randomly converse with their neighbors on a graph, agreeing on one of the two states. The probability…
How to elect the representatives in legislative bodies is a question that every modern democracy has to answer. This design task has to consider various elements so as to fulfill the citizens' expectations and contribute to the maintenance…
We propose a model for diffusion of two opposite opinions. Here, the decision to be taken by each individual is a random variable which depends on the tendency of the population, as well on its own trend characteristic. The influence of the…
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…
We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th…
Apportionment is the task of assigning resources to entities with different entitlements in a fair manner, and specifically a manner that is as proportional as possible. The best-known application is the assignment of parliamentary seats to…
This paper examines an area of Game Theory called Voting Power Theory. With the adoption of a measure theoretic framework it argues that the many different indices and tools currently used for measuring voting power can be replaced by just…
We investigate a variation of the classical voter model in which the set of influencing agents depends on an individual's current opinion. The initial population consists of a random sample of equally sized sub-populations for each state,…
A method for studying exact properties of a class of {\it inhomogeneous} stochastic many-body systems is developed and presented in the framework of a voter model perturbed by the presence of a ``zealot'', an individual allowed to favour an…
This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the…
A mathematical analysis of the distribution of voting power in the Council of the European Union operating according to the Treaty of Lisbon is presented. We study the effects of Brexit on the voting power of the remaining members, measured…
Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case…
Criteria for a good voting system have been given particularly careful scrutiny in recent years, with general agreement that the core values are fair results, voter power and choice, and local representation. This paper reexamines the basic…
We study how office-seeking parties use direct democracy to shape elections. A party with a strong electoral base can benefit from using a binding referendum to resolve issues that divide its core supporters. When referendums do not bind,…
The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a given target candidate. Voters reached by the campaign change…
Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of $k$ distinct opinions, and at each step a random vertex alters its opinion to that of a randomly chosen neighbour. If the…
We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…