Author:
Staudacher Jochen,Kóczy László Á.,Stach Izabella,Filipp Jan,Kramer Marcus,Noffke Till,Olsson Linus,Pichler Jonas,Singer Tobias
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 smallest size, as well as a very first method for computing 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.
Publisher
Politechnika Wroclawska Oficyna Wydawnicza
Subject
Management of Technology and Innovation,Management Science and Operations Research,Statistics, Probability and Uncertainty,Modeling and Simulation,Statistics and Probability
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献