Improved lower bound on the dimension of the EU council's voting rules

03/25/2020
by   Stefan Kober, et al.
0

Kurz and Napel (2015) proved that the voting system of the EU council (based on the 2014 population data) cannot be represented as the intersection of six weighted games, i.e., its dimension is at least 7. This set a new record for real-world voting rules and the authors posed the exact determination as a challenge. Recently, Chen, Cheung, and Ng (2019) showed that the dimension is at most 24. We provide the first improved lower bound and show that the dimension is at least 8.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2019

An upper bound on the dimension of the voting system of the European Union Council under the Lisbon rules

The voting rules of the European Council (EU) under the Treaty of Lisbon...
research
05/18/2021

Improved Ackermannian lower bound for the VASS reachability problem

This draft is a follow-up of the Ackermannian lower bound for the reacha...
research
05/27/2019

Subspace code constructions

We improve on the lower bound of the maximum number of planes of PG(8,q...
research
09/05/2021

Dimensionality, Coordination, and Robustness in Voting

We study the performance of voting mechanisms from a utilitarian standpo...
research
09/12/2022

An Improved Lower Bound for Matroid Intersection Prophet Inequalities

We consider prophet inequalities subject to feasibility constraints that...
research
02/13/2019

Computing the Yolk in Spatial Voting Games without Computing Median Lines

The yolk is an important concept in spatial voting games as it generalis...
research
08/19/2015

Fishing out Winners from Vote Streams

We investigate the problem of winner determination from computational so...

Please sign up or login with your details

Forgot password? Click here to reset