Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/257583 
Erscheinungsjahr: 
2022
Quellenangabe: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 13 [Issue:] 1 [Article No.:] 6 [Publisher:] MDPI [Place:] Basel [Year:] 2022 [Pages:] 1-17
Verlag: 
MDPI, Basel
Zusammenfassung: 
We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices for weighted voting games, we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e., the Owen index, the Banzhaf-Owen index and the symmetric coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times, as well as storage requirements.
Schlagwörter: 
Banzhaf index
cooperative game theory
dynamic programming
Owen value
power indices
precoalitions
Shapley value
weighted voting games
JEL: 
C71
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Erscheint in der Sammlung:

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.