Abstract

TheShapley-Shubik power index in a voting situation depends on the number of orderings in which each player is pivotal. TheBanzhaf power index depends on the number of ways in which each voter can effect a swing. We introduce a combinatorial method based ingenerating functions for computing these power indices efficiently and we study thetime complexity of the algorithms. We also analyze the meet of two weighted voting games. Finally, we compute the voting power in the Council of Ministers of the European Union with the generating functions algorithms and we present its implementation in the system Mathematica.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.