Abstract
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2 N of winning coalitions. (Vector-) weighted majority games ((V) WMG) are a special case of simple games, in which an integer (vector) weight can be assigned to each player and there is a quota which a coalition has to achieve in order to win. Binary decision diagrams (BDDs) are used as compact representations for Boolean functions and sets of subsets. This paper shows, how a quasi-reduced and ordered BDD (QOBDD) of the winning coalitions of a (V) WMG can be build, how one can compute the minimal winning coalitions and how one can easily compute the Banzhaf, Shapley–Shubik, Holler–Packel and Deegan–Packel indices of the players. E.g. in case of weighted majority games it is shown that the Banzhaf and Holler–Packel indices of all players can be computed in expected time O ( nQ ) and in general, the Banzhaf indices can be computed in time linear in the size of the QOBDD representation of the winning coalitions. Other running times are proven as well. The algorithms were tested on some real world games, e.g. the International Monetary Fund and the EU Treaty of Nice.
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.