Pith. sign in

REVIEW

On minimum sum representations for weighted voting games

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1103.1445 v2 pith:ZRK4ZTDK submitted 2011-03-08 math.CO

classification math.CO
keywords votingweightedgamesminimumvotersquotarepresentationrepresentations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools