A weighted voting game assigns nonnegative weights to players and a threshold , and declares a coalition winning whenNonnegative weights make the rule monotone. The empty coalition loses, and the grand coalition wins when ; under that nontrivial condition this is a simple cooperative game.
If all weights are integers, the strict threshold is equivalent to the weak quota . It becomes quota when is itself an integer. This distinction matters for noninteger thresholds.
For example, three unit weights and give two-of-three majority. Nonnegative weights do not imply a convex cooperative game: , while , violating the supermodular inequality.
Suppose winning coalitions and losing coalitions contain each player the same total number of times:No real-weight, weak-quota weighted voting game represents those outcomes. Summing weights over the winning family gives at least , while summing over the losing family gives strictly less than . Equal player multiplicities make the two sums identical, a contradiction. This certificate works without assuming nonnegative weights.
For example, the winners and losers form a two-against-two obstruction. A monotone game whose minimal winning coalitions are the first two sets realizes this certificate, even though every winner contains player .
A zero-one coalitional game has this property if exchanging one player each way between two disjoint winning coalitions leaves at least one winning. Any weighted voting game satisfies it: the exchange preserves their aggregate weight, which is at least twice the quota, whereas two losing coalitions would have aggregate weight strictly below twice the quota.
The disjointness restriction is substantive. If every winning coalition contains a common player, the condition is vacuous. It is consequently weaker than restrictions allowing exchanges between overlapping winning coalitions, and does not characterize weighted voting games.
Articles by others on the same topic
There are currently no matching articles.