On minimum sum representations for weighted voting games

DOI10.1007/S10479-012-1108-3zbMATH Open1259.91043arXiv1103.1445OpenAlexW2032670288MaRDI QIDQ1761826FDOQ1761826

Sascha Kurz

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1103.1445

zbMATH Keywords

simple gamesweighted voting gamesrealizations with minimum summinimum realizations

Mathematics Subject Classification ID

Voting theory (91B12)

Cites Work

• Title not available (Why is that?)
• Enumeration of Seven-Argument Threshold Functions
• Complete simple games
• A fast algorithm for the maximum clique problem
• A class of simple games
• On the existence of a minimum integer representation for weighted voting systems
• The inverse Banzhaf problem
• On the inverse power index problem
• Weighted games without a unique minimal representation in integers
• On Dedekind's problem for complete simple games
• Directed and weighted majority games
• The Modified Nucleolus as Canonical Representation of Weighted Majority Games
• On the Enumeration of Majority Games
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• Majority Decision Functions of up to Six Variables
• Enumeration of Threshold Functions of Eight Variables

Cited In (25)

• On the enumeration of Boolean functions with distinguished variables
• On the enumeration of bipartite simple games
• On the characterization of weighted simple games
• The minimum sum representation as an index of voting power
• Representation-compatible power indices
• Weighted committee games
• Dimension of the Lisbon voting rules in the EU council: a challenge and new world record
• On the existence of a minimum integer representation for weighted voting systems
• The inverse problem for power distributions in committees
• The cost of getting local monotonicity
• On minimum integer representations of weighted games
• Average weights and power in weighted voting games
• On \(\alpha\)-roughly weighted games
• Trading transforms of non-weighted simple games and integer weights of weighted simple games
• Some open problems in simple games
• Heuristic and exact solutions to the inverse power index problem for small voting bodies
• All power structures are achievable in basic weighted games
• On weights and quotas for weighted majority voting games
• Correction to: ``On minimum sum representations for weighted voting games
• The nucleolus of large majority games
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
• Bounds for the Nakamura number
• IMPORTANCE IN SYSTEMS WITH INTERVAL DECISIONS
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Uses Software

• Cliquer

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)