EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Dynamic Programming for Computing Power Indices for Weighted Voting Games with Precoalitions

Jochen Staudacher, Felix Wagner, Jan Filipp

Games · 26.12.2021 · 13 (1) · 6

DOI: 10.3390/g13010006 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Games, online erschienen am 26.12.2021. Verfasst von Jochen Staudacher und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 49 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Staudacher, J., Wagner, F., & Filipp, J. (2021). Dynamic Programming for Computing Power Indices for Weighted Voting Games with Precoalitions. Games, 13(1), 6. https://doi.org/10.3390/g13010006

Vancouver

Staudacher J, Wagner F, Filipp J. Dynamic Programming for Computing Power Indices for Weighted Voting Games with Precoalitions. Games. 2021;13(1):6. doi:10.3390/g13010006

BibTeX
@article{Staudacher2021,
  author = {Staudacher, Jochen and Wagner, Felix and Filipp, Jan},
  title = {Dynamic Programming for Computing Power Indices for Weighted Voting Games with Precoalitions},
  journal = {Games},
  year = {2021},
  volume = {13},
  number = {1},
  pages = {6},
  doi = {10.3390/g13010006}
}
Kostenlos starten →