Staudacher, J. and Kóczy, László Áron and Stach, I. and Filipp, J. and Kramer, M. (2021) Computing power indices for weighted voting games via dynamic programming. OPERATION RESEARCH AND DECISIONS, 31 (2). pp. 123-145. ISSN 2081-8858
|
Text
157620-20published.pdf Download (259kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | dynamic programming; Cooperative game theory; Power indices; weighted voting games; minimal winning coalitions; |
| Subjects: | H Social Sciences / társadalomtudományok > HC Economic History and Conditions / gazdaság története és alapelvek > HC1 History of economic theories / közgazdasági elméletek |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 16 Mar 2022 17:09 |
| Last Modified: | 16 Mar 2022 17:09 |
| URI: | http://real.mtak.hu/id/eprint/138847 |
Actions (login required)
 |
Edit Item |
