Algorithms for the shapley and myerson values in graph-restricted games

Oskar Skibski, Tomasz P. Michalak, Talal Rahwan, Michael Wooldridge

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

Abstract

Graph-restricted games, first introduced by Myerson [20], model naturally-occurring scenarios where coordination between any two agents within a coalition is only possible if there is a communication channel(a path) between them. Two fundamental solution concepts that were proposed for such a game are the Shapley value and the Myerson value. While an algorithm has been proposed to compute the Shapley value in arbitrary graph-restricted games, no such general-purpose algorithm has yet been developed for the Myerson value. Our aim in this paper is to develop a more efficient algorithm for computing the Shapley value, and to develop a general-purpose algorithm for computing the Myerson value, in graph-restricted games. Since the computation of either value involves visiting all connected induced subgraphs of the graph underlying the game, we start by developing an algorithm dedicated for this purpose, and show that it is faster that the fastest available one in the literature. This algorithm is then used as the cornerstone upon which we build two algorithms. The first is designed to compute the Shapley value, and is shown to be more efficient than the state of the art. The second is the first dedicated algorithm to compute the Myerson value in arbitrary graphs.

Original languageEnglish (US)
Title of host publication13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages197-204
Number of pages8
Volume1
ISBN (Electronic)9781634391313
StatePublished - Jan 1 2014
Event13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 - Paris, France
Duration: May 5 2014May 9 2014

Other

Other13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
CountryFrance
CityParis
Period5/5/145/9/14

Keywords

  • Enumerating induced connected subgraphs
  • Myerson value
  • Shapley value
  • Terrorist networks

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Skibski, O., Michalak, T. P., Rahwan, T., & Wooldridge, M. (2014). Algorithms for the shapley and myerson values in graph-restricted games. In 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 (Vol. 1, pp. 197-204). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

Algorithms for the shapley and myerson values in graph-restricted games. / Skibski, Oskar; Michalak, Tomasz P.; Rahwan, Talal; Wooldridge, Michael.

13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. Vol. 1 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014. p. 197-204.

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

Skibski, O, Michalak, TP, Rahwan, T & Wooldridge, M 2014, Algorithms for the shapley and myerson values in graph-restricted games. in 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. vol. 1, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), pp. 197-204, 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, Paris, France, 5/5/14.
Skibski O, Michalak TP, Rahwan T, Wooldridge M. Algorithms for the shapley and myerson values in graph-restricted games. In 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. Vol. 1. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). 2014. p. 197-204
Skibski, Oskar ; Michalak, Tomasz P. ; Rahwan, Talal ; Wooldridge, Michael. / Algorithms for the shapley and myerson values in graph-restricted games. 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. Vol. 1 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014. pp. 197-204
@inproceedings{27685de2e21b418fadaca022e4db9bac,
title = "Algorithms for the shapley and myerson values in graph-restricted games",
abstract = "Graph-restricted games, first introduced by Myerson [20], model naturally-occurring scenarios where coordination between any two agents within a coalition is only possible if there is a communication channel(a path) between them. Two fundamental solution concepts that were proposed for such a game are the Shapley value and the Myerson value. While an algorithm has been proposed to compute the Shapley value in arbitrary graph-restricted games, no such general-purpose algorithm has yet been developed for the Myerson value. Our aim in this paper is to develop a more efficient algorithm for computing the Shapley value, and to develop a general-purpose algorithm for computing the Myerson value, in graph-restricted games. Since the computation of either value involves visiting all connected induced subgraphs of the graph underlying the game, we start by developing an algorithm dedicated for this purpose, and show that it is faster that the fastest available one in the literature. This algorithm is then used as the cornerstone upon which we build two algorithms. The first is designed to compute the Shapley value, and is shown to be more efficient than the state of the art. The second is the first dedicated algorithm to compute the Myerson value in arbitrary graphs.",
keywords = "Enumerating induced connected subgraphs, Myerson value, Shapley value, Terrorist networks",
author = "Oskar Skibski and Michalak, {Tomasz P.} and Talal Rahwan and Michael Wooldridge",
year = "2014",
month = "1",
day = "1",
language = "English (US)",
volume = "1",
pages = "197--204",
booktitle = "13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",

}

TY - GEN

T1 - Algorithms for the shapley and myerson values in graph-restricted games

AU - Skibski, Oskar

AU - Michalak, Tomasz P.

AU - Rahwan, Talal

AU - Wooldridge, Michael

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Graph-restricted games, first introduced by Myerson [20], model naturally-occurring scenarios where coordination between any two agents within a coalition is only possible if there is a communication channel(a path) between them. Two fundamental solution concepts that were proposed for such a game are the Shapley value and the Myerson value. While an algorithm has been proposed to compute the Shapley value in arbitrary graph-restricted games, no such general-purpose algorithm has yet been developed for the Myerson value. Our aim in this paper is to develop a more efficient algorithm for computing the Shapley value, and to develop a general-purpose algorithm for computing the Myerson value, in graph-restricted games. Since the computation of either value involves visiting all connected induced subgraphs of the graph underlying the game, we start by developing an algorithm dedicated for this purpose, and show that it is faster that the fastest available one in the literature. This algorithm is then used as the cornerstone upon which we build two algorithms. The first is designed to compute the Shapley value, and is shown to be more efficient than the state of the art. The second is the first dedicated algorithm to compute the Myerson value in arbitrary graphs.

AB - Graph-restricted games, first introduced by Myerson [20], model naturally-occurring scenarios where coordination between any two agents within a coalition is only possible if there is a communication channel(a path) between them. Two fundamental solution concepts that were proposed for such a game are the Shapley value and the Myerson value. While an algorithm has been proposed to compute the Shapley value in arbitrary graph-restricted games, no such general-purpose algorithm has yet been developed for the Myerson value. Our aim in this paper is to develop a more efficient algorithm for computing the Shapley value, and to develop a general-purpose algorithm for computing the Myerson value, in graph-restricted games. Since the computation of either value involves visiting all connected induced subgraphs of the graph underlying the game, we start by developing an algorithm dedicated for this purpose, and show that it is faster that the fastest available one in the literature. This algorithm is then used as the cornerstone upon which we build two algorithms. The first is designed to compute the Shapley value, and is shown to be more efficient than the state of the art. The second is the first dedicated algorithm to compute the Myerson value in arbitrary graphs.

KW - Enumerating induced connected subgraphs

KW - Myerson value

KW - Shapley value

KW - Terrorist networks

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

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

M3 - Conference contribution

AN - SCOPUS:84911404011

VL - 1

SP - 197

EP - 204

BT - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014

PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)

ER -