The minimum sum representation as an index of voting power
From MaRDI portal
Publication:297030
DOI10.1016/j.ejor.2013.09.010zbMath1339.91049OpenAlexW2163909962MaRDI QIDQ297030
Serguei Kaniovski, Josep Freixas
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/21411
rankingspower indicesbicameral meetminimum integer sum representationproportional design between shares and power
Related Items
The inverse problem for power distributions in committees, Representation-compatible power indices, Preference integration and optimization of multistage weighted voting system based on ordinal preference, Weighted committee games, Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras, Power indices for networks, with applications to matching markets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ordinal equivalence of the Johnston, Banzhaf and Shapley power indices
- A minimum dimensional class of simple games
- Achievable hierarchies in voting games
- On the core, the Weber set and convexity in games with a priori unions
- Simple majority achievable hierarchies
- On the existence of a minimum integer representation for weighted voting systems
- A new index of power for simple n-person games
- Complete simple games
- The bicameral postulates and indices of a priori voting power
- Modification of the Banzhaf value for games with a coalition structure
- On minimum sum representations for weighted voting games
- The inverse Banzhaf problem
- Hierarchies achievable in simple games
- Finding multiple solutions to general integer linear programs
- On ordinal equivalence of power measures given by regular semivalues
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- On the inverse power index problem
- A CLASS OF MAJORITY GAMES
- Mathematics and Politics
- Weighted games without a unique minimal representation in integers
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
