Abstract
Having a group of voters endowed with weights, the simple weighted voting game (or system) represents a system of approving propositions in which the approved is only a proposition that is accepted by voters weighted to a number that is at least equal to a prescribed number called a quota. We call the system simple if there is only one set of weights and one quota, as opposed to the multi-rule systems that have more weights assigned to each voter and with more quotas.
This paper presents an analysis of the efficiency of simple weighted voting systems. It assumes the Impartial Anonymous Culture.
The efficiency of a simple weighted voting system is defined as the probability of a proposition being approved. This paper focuses on efficiency maximization and minimization with respect to weights.
We prove a theorem which enables the computing of the efficiency maximum and efficiency minimum with respect to weights, given the number of voters and quota in linear time.