On minimum sum representations for weighted voting games
From MaRDI portal
Abstract: A proposal in a weighted voting game is accepted if the sum of the (non-negative) weights of the "yea" voters is at least as large as a given quota. Several authors have considered representations of weighted voting games with minimum sum, where the weights and the quota are restricted to be integers. Freixas and Molinero have classified all weighted voting games without a unique minimum sum representation for up to 8 voters. Here we exhaustively classify all weighted voting games consisting of 9 voters which do not admit a unique minimum sum integer weight representation.
Recommendations
- On minimum integer representations of weighted games
- On the existence of a minimum integer representation for weighted voting systems
- Weighted games without a unique minimal representation in integers
- On the minimal representation of homogeneous games
- The minimum sum representation as an index of voting power
Cites work
- A class of simple games
- A fast algorithm for the maximum clique problem
- Complete simple games
- Directed and weighted majority games
- Enumeration of Seven-Argument Threshold Functions
- Enumeration of Threshold Functions of Eight Variables
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- scientific article; zbMATH DE number 1357433 (Why is no real title available?)
- Majority Decision Functions of up to Six Variables
- On Dedekind's problem for complete simple games
- On the Enumeration of Majority Games
- On the existence of a minimum integer representation for weighted voting systems
- On the inverse power index problem
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- The inverse Banzhaf problem
- The Modified Nucleolus as Canonical Representation of Weighted Majority Games
- Weighted games without a unique minimal representation in integers
Cited in
(30)- On the existence of a minimum integer representation for weighted voting systems
- On the minimal representation of homogeneous games
- Representation-compatible power indices
- On the characterization of weighted simple games
- Correction to: ``On minimum sum representations for weighted voting games
- Average weights and power in weighted voting games
- Weighted voting procedure having a unique blocker
- On the enumeration of bipartite simple games
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
- On the enumeration of Boolean functions with distinguished variables
- Trading transforms of non-weighted simple games and integer weights of weighted simple games
- Weighted committee games
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Bounds for the Nakamura number
- On minimum integer representations of weighted games
- The nucleolus of large majority games
- A note on hierarchies in weighted voting games and partitions
- The inverse problem for power distributions in committees
- On weights and quotas for weighted majority voting games
- Some open problems in simple games
- The minimum sum representation as an index of voting power
- Dimension of the Lisbon voting rules in the EU council: a challenge and new world record
- The cost of getting local monotonicity
- Weighted games without a unique minimal representation in integers
- On -roughly weighted games
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
- IMPORTANCE IN SYSTEMS WITH INTERVAL DECISIONS
- All power structures are achievable in basic weighted games
- ILP and CP models for normalized integer weighted voting game design problem
- Heuristic and exact solutions to the inverse power index problem for small voting bodies
This page was built for publication: On minimum sum representations for weighted voting games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761826)
