Dynamic programming algorithms for computing power indices in weighted multi-tier games

Ingo Wilms

Mathematical Social Sciences, 2020, vol. 108, issue C, 175-192

Abstract: In weighted games each voter has a weight assigned and “yes”-voters win if the sum of each weight is greater than or equal to the quota. In weighted multi-tier games, we have several weighted games (tiers) over the same set of voters. In this article, algorithms for calculating Banzhaf and Shapley–Shubik indices for three different type of games are proposed: weighted AND-games, weighted OR-games and games where the tiers have conjunctive normal form. The presented algorithms are generalizations of known computational methods using dynamic programming technique. Finally, some applications and experiments are carried out and these algorithms are compared to a fairly new method based on binary decision diagrams.

Keywords: Power indices; Banzhaf index; Shapley–Shubik index; Dynamic programming; Binary decision diagram; Council of the European Union (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489620300603
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:108:y:2020:i:c:p:175-192

DOI: 10.1016/j.mathsocsci.2020.06.004

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().