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

Oskar Skibski, Makoto Yokoo

Research output: Contribution to journalReview article

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Article number7851152
Pages (from-to)32-39
Number of pages8
JournalIEEE Intelligent Systems
Volume32
Issue number1
DOIs
Publication statusPublished - Jan 1 2017

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting. / Skibski, Oskar; Yokoo, Makoto.

In: IEEE Intelligent Systems, Vol. 32, No. 1, 7851152, 01.01.2017, p. 32-39.

Research output: Contribution to journalReview article

@article{7f80effe016d494ca26fb503df9670a0,
title = "An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting",
abstract = "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.",
author = "Oskar Skibski and Makoto Yokoo",
year = "2017",
month = "1",
day = "1",
doi = "10.1109/MIS.2017.3",
language = "English",
volume = "32",
pages = "32--39",
journal = "IEEE Intelligent Systems",
issn = "1541-1672",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

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

AU - Skibski, Oskar

AU - Yokoo, Makoto

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/MIS.2017.3

DO - 10.1109/MIS.2017.3

M3 - Review article

VL - 32

SP - 32

EP - 39

JO - IEEE Intelligent Systems

JF - IEEE Intelligent Systems

SN - 1541-1672

IS - 1

M1 - 7851152

ER -