Weighted and Roughly Weighted Simple Games
T. Gvozdeva, A. Slinko

TL;DR
This paper explores the conditions under which simple games can be classified as weighted or roughly weighted, introduces functions to measure deviation from these classes, and improves bounds related to these properties.
Contribution
It provides necessary and sufficient conditions for rough weightedness and introduces functions to quantify deviation from weightedness in simple games.
Findings
Derived bounds for functions measuring deviation from weightedness.
Established conditions for rough weightedness of simple games.
Analyzed rough weightedness in small-player simple games.
Abstract
This paper contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern (1944). One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The necessary and sufficient conditions that guarantee weightedness were obtained by Elgot (1961) and refined by Taylor and Zwicker (1992). If a simple game does not have weights, then rough weights may serve as a reasonable substitute (see their use in Taylor and Zwicker, 1992). A simple game is roughly weighted if there exists a system of weights and a threshold such that all coalitions whose combined weight is above the threshold are winning and all coalitions whose combined weight is below the threshold are losing and a tie-breaking is needed to classify the coalitions whose combined weight is exactly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Game Theory and Applications · Auction Theory and Applications
