Computing Power Indices for Weighted Voting Games Via Dynamic Programming
We study the efficient computation of power indices for weighted voting games using the paradigm of dynamic programming. We survey the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices and point out how these approaches carry over to related power indices. Within a uni...
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wrocław University of Science and Technology
2021-01-01
|
| Series: | Operations Research and Decisions |
| Online Access: | http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1576 |