TY - JOUR A1 - Staudacher, Jochen A1 - Wagner, Felix A1 - Filipp, Jan T1 - Dynamic Programming for Computing Power Indices for Weighted Voting Games with Precoalitions T2 - Games N2 - 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. KW - Spieltheorie KW - Dynamische Optimierung KW - Weighted Voting Games KW - Dynamic Programming KW - Precoalitions KW - Owen value Y1 - 2021 UR - https://opus4.kobv.de/opus4-hs-kempten/frontdoor/index/index/docId/1053 SN - 2073-4336 VL - 2022 IS - 13 / 1 SP - 1 EP - 17 PB - MDPI CY - Basel ER -