A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games

Abstract

Weighted voting games allow for studying the distribution of power between agents in situations of collective decision making. While the conventional version of these games assumes that any agent is always ready to cooperate with all others, recently, more involved models have been proposed, where cooperation is subject to restrictions. Following Myerson… (More)

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Skibski2015APA, title={A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games}, author={Oskar Skibski and Tomasz P. Michalak and Yuko Sakurai and Makoto Yokoo}, booktitle={IJCAI}, year={2015} }