Abstract
We consider simple games which are constructed as iterated weighted majority games. It turns out that every proper simple game can be obtained in this way. The minimal number of iterations necessary to obtain a given game is called the height of this game. We investigate the behaviour ofh (n), the maximal height of a simple game withn players.
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.