A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games

Oskar Skibski, Tomasz P. Michalak, Yuko Sakurai, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 [1977], such restrictions are typically represented by a graph that expresses available communication links among agents. In this paper, we study the time complexity of computing two well-known power indices - the Shapley-Shubik index and the Banzhaf index - in the graph-restricted weighted voting games. We show that both are #P-complete and propose a dedicated dynamic-programming algorithm that runs in pseudo-polynomial time for graphs with the bounded treewidth.

Original languageEnglish
Title of host publicationIJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence
EditorsMichael Wooldridge, Qiang Yang
PublisherInternational Joint Conferences on Artificial Intelligence
Pages631-637
Number of pages7
ISBN (Electronic)9781577357384
Publication statusPublished - Jan 1 2015
Event24th International Joint Conference on Artificial Intelligence, IJCAI 2015 - Buenos Aires, Argentina
Duration: Jul 25 2015Jul 31 2015

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
Volume2015-January
ISSN (Print)1045-0823

Other

Other24th International Joint Conference on Artificial Intelligence, IJCAI 2015
CountryArgentina
CityBuenos Aires
Period7/25/157/31/15

Fingerprint

Polynomials
Dynamic programming
Telecommunication links
Decision making

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Skibski, O., Michalak, T. P., Sakurai, Y., & Yokoo, M. (2015). A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games. In M. Wooldridge, & Q. Yang (Eds.), IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence (pp. 631-637). (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2015-January). International Joint Conferences on Artificial Intelligence.

A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games. / Skibski, Oskar; Michalak, Tomasz P.; Sakurai, Yuko; Yokoo, Makoto.

IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence. ed. / Michael Wooldridge; Qiang Yang. International Joint Conferences on Artificial Intelligence, 2015. p. 631-637 (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2015-January).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Skibski, O, Michalak, TP, Sakurai, Y & Yokoo, M 2015, A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games. in M Wooldridge & Q Yang (eds), IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence. IJCAI International Joint Conference on Artificial Intelligence, vol. 2015-January, International Joint Conferences on Artificial Intelligence, pp. 631-637, 24th International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 7/25/15.
Skibski O, Michalak TP, Sakurai Y, Yokoo M. A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games. In Wooldridge M, Yang Q, editors, IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence. 2015. p. 631-637. (IJCAI International Joint Conference on Artificial Intelligence).
Skibski, Oskar ; Michalak, Tomasz P. ; Sakurai, Yuko ; Yokoo, Makoto. / A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games. IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence. editor / Michael Wooldridge ; Qiang Yang. International Joint Conferences on Artificial Intelligence, 2015. pp. 631-637 (IJCAI International Joint Conference on Artificial Intelligence).
@inproceedings{5b47f5d2f818406d95b89cdb15e588dd,
title = "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 [1977], such restrictions are typically represented by a graph that expresses available communication links among agents. In this paper, we study the time complexity of computing two well-known power indices - the Shapley-Shubik index and the Banzhaf index - in the graph-restricted weighted voting games. We show that both are #P-complete and propose a dedicated dynamic-programming algorithm that runs in pseudo-polynomial time for graphs with the bounded treewidth.",
author = "Oskar Skibski and Michalak, {Tomasz P.} and Yuko Sakurai and Makoto Yokoo",
year = "2015",
month = "1",
day = "1",
language = "English",
series = "IJCAI International Joint Conference on Artificial Intelligence",
publisher = "International Joint Conferences on Artificial Intelligence",
pages = "631--637",
editor = "Michael Wooldridge and Qiang Yang",
booktitle = "IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games

AU - Skibski, Oskar

AU - Michalak, Tomasz P.

AU - Sakurai, Yuko

AU - Yokoo, Makoto

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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 [1977], such restrictions are typically represented by a graph that expresses available communication links among agents. In this paper, we study the time complexity of computing two well-known power indices - the Shapley-Shubik index and the Banzhaf index - in the graph-restricted weighted voting games. We show that both are #P-complete and propose a dedicated dynamic-programming algorithm that runs in pseudo-polynomial time for graphs with the bounded treewidth.

AB - 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 [1977], such restrictions are typically represented by a graph that expresses available communication links among agents. In this paper, we study the time complexity of computing two well-known power indices - the Shapley-Shubik index and the Banzhaf index - in the graph-restricted weighted voting games. We show that both are #P-complete and propose a dedicated dynamic-programming algorithm that runs in pseudo-polynomial time for graphs with the bounded treewidth.

UR - http://www.scopus.com/inward/record.url?scp=84947257601&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947257601&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947257601

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 631

EP - 637

BT - IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence

A2 - Wooldridge, Michael

A2 - Yang, Qiang

PB - International Joint Conferences on Artificial Intelligence

ER -