Square root voting system, optimal threshold and \pi
Karol Zyczkowski, Wojciech Slomczynski

TL;DR
This paper investigates the optimal design of a two-tier weighted voting system, focusing on the square root voting method, and derives an explicit formula for the optimal threshold based on the number of member states.
Contribution
It establishes a link between the square root voting system and random walks, and derives an explicit approximate formula for the optimal voting threshold.
Findings
Optimal threshold q ≈ 1/2 + 1/√(π M) for a union of M states.
Voting power closely matches voting weights when threshold is optimally chosen.
The prefactor 1/√(π) arises from averaging over random population unions.
Abstract
The problem of designing an optimal weighted voting system for the two-tier voting, applicable in the case of the Council of Ministers of the European Union (EU), is investigated. Various arguments in favour of the square root voting system, where the voting weights of member states are proportional to the square root of their population are discussed and a link between this solution and the random walk in the one-dimensional lattice is established. It is known that the voting power of every member state is approximately equal to its voting weight, if the threshold q for the qualified majority in the voting body is optimally chosen. We analyze the square root voting system for a generic 'union' of M states and derive in this case an explicit approximate formula for the level of the optimal threshold: q \simeq 1/2+1/\sqrt{{\pi} M}. The prefactor 1/\sqrt{{\pi}} appears here as a result of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
