- Tytuł:
- Computing power indices for weighted voting games via dynamic programming
- Autorzy:
-
Staudacher, Jochen
Kóczy, László Á.
Stach, Izabella
Filipp, Jan
Kramer, Marcus
Noffke, Till
Olsson, Linuss
Pichler, Jonas
Singer, Tobias - Powiązania:
- https://bibliotekanauki.pl/articles/2099634.pdf
- Data publikacji:
- 2021
- Wydawca:
- Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
- Tematy:
-
cooperative game theory
power indices
weighted voting games
dynamic programming
minimal winning coalitions - Opis:
- 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 unified framework, we present new efficient algorithms for the Public Good index and a recently proposed power index based on minimal winning coalitions of the smallest size, as well as a very first method for computing the Johnston indices for weighted voting games efficiently. We introduce a software package providing fast C++ implementations of all the power indices mentioned in this article, discuss computing times, as well as storage requirements.
- Źródło:
-
Operations Research and Decisions; 2021, 31, 2; 123--145
2081-8858
2391-6060 - Pojawia się w:
- Operations Research and Decisions
- Dostawca treści:
- Biblioteka Nauki
Artykuł