An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting

Oskar Skibski, Makoto Yokoo

研究成果: Contribution to journalReview article査読

1 被引用数 (Scopus)

抄録

Myerson's graph-restricted games are a well-known formalism for modeling cooperation that's subject to restrictions. In particular, Myerson considered a coalitional game in which cooperation is possible only through an underlying network of links between agents. A unique fair solution concept for graph-restricted games is called the Myerson value. One study generalized these results by considering probabilistic graphs in which agents can cooperate via links only to some extent, that is, with some probability. The authors' algorithm is based on the enumeration of all connected subgraphs in the graph. As a sample application of the new algorithm, they consider a probabilistic graph that represents likelihood of pairwise collaboration between political parties before the 2015 general elections in the UK.

本文言語英語
論文番号7851152
ページ(範囲)32-39
ページ数8
ジャーナルIEEE Intelligent Systems
32
1
DOI
出版ステータス出版済み - 1 1 2017

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Artificial Intelligence

引用スタイル