Pith. sign in

REVIEW

Are weighted games sufficiently good for binary voting?

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 2006.05330 v3 pith:OJJZB5JB submitted 2020-06-09 cs.GT econ.TH

classification cs.GTecon.TH
keywords weightedgamesbinarypowervotingaccordingachievablecommittee
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Binary yes-no decisions in a legislative committee or a shareholder meeting are commonly modeled as a weighted game. However, there are noteworthy exceptions. E.g., the voting rules of the European Council according to the Treaty of Lisbon use a more complicated construction. Here we want to study the question if we lose much from a practical point of view, if we restrict ourselves to weighted games. To this end, we invoke power indices that measure the influence of a member in binary decision committees. More precisely, we compare the achievable power distributions of weighted games with those from a reasonable superset of weighted games. It turns out that the deviation is relatively small.

Discussion (0). Continue with ORCID to comment.

Pith tools