Abstract
The counting vector of a simple game is the vector $f = (f(1),f(2), \cdots ,f(n))$ where $f(i)$ is the number of winning coalitions containing the player $i$. In this paper, we show that the counting vector of a weighted majority game determines the game uniquely. With the aid of the counting vector we find an upper bound on the number of weighted majority games.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.