This paper provides new proofs for some properties of the instant runoff voting rule, namely clone-proofness and strict social disappointment criterion. We show that instant runoff voting, contrary to most voting protocols, is not only immune to the strategic nomination, but also does not...

We develop a numerical model that simulates the evolution of a virtual population with an incentive and ability-based wage, capital yield from savings, social welfare system, and total income subject to taxation and political turnovers. Meta-heuristics, particle swarm optimization (PSO) in...

This paper deals with the problem of calculating the Shapley-Shubik power index in weighted majority games. We propose an efficient Monte Carlo algorithm based on an implicit hierarchical structure of permutations of players. Our algorithm outputs a vector of power indices preserving the...

We propose a class of decisive collective choice rules that rely on a linear ordering to partition the majority relation into two acyclic relations. The first of these relations is used to pare down the set of the feasible alternatives into a shortlist while the second is used to make a final...

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and...

Debates on an EU-leaving referendum arose in several member states after Brexit. We want to highlight how the exit of an additional country affects the power distribution in the Council of the European Union. We inspect the power indices of the member states both with and without the country...