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

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

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

7 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルIJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence
編集者Michael Wooldridge, Qiang Yang
出版社International Joint Conferences on Artificial Intelligence
ページ631-637
ページ数7
ISBN(電子版)9781577357384
出版ステータス出版済み - 1月 1 2015
イベント24th International Joint Conference on Artificial Intelligence, IJCAI 2015 - Buenos Aires, アルゼンチン
継続期間: 7月 25 20157月 31 2015

出版物シリーズ

名前IJCAI International Joint Conference on Artificial Intelligence
2015-January
ISSN(印刷版)1045-0823

その他

その他24th International Joint Conference on Artificial Intelligence, IJCAI 2015
国/地域アルゼンチン
CityBuenos Aires
Period7/25/157/31/15

!!!All Science Journal Classification (ASJC) codes

  • 人工知能

フィンガープリント

「A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル