A graphical representation for games in partition function form

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

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

4 Citations (Scopus)

Abstract

We propose a novel representation for coalitional games with externalities, called Partition Decision Trees. This representation is based on rooted directed trees, where non-leaf nodes are labelled with agents' names, leaf nodes are labelled with payoff vectors, and edges indicate membership of agents in coalitions. We show that this representation is fully expressive, and for certain classes of games significantly more concise than an extensive representation. Most importantly, Partition Decision Trees are the first formalism in the literature under which most of the direct extensions of the Shapley value to games with externalities can be computed in polynomial time.

Original languageEnglish
Title of host publicationProceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015
PublisherAI Access Foundation
Pages1036-1042
Number of pages7
ISBN (Electronic)9781577357001
Publication statusPublished - Jun 1 2015
Event29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015 - Austin, United States
Duration: Jan 25 2015Jan 30 2015

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume2

Other

Other29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015
CountryUnited States
CityAustin
Period1/25/151/30/15

Fingerprint

Decision trees
Polynomials

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

Skibski, O., Michalak, T. P., Sakurai, Y., Wooldridge, M., & Yokoo, M. (2015). A graphical representation for games in partition function form. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015 (pp. 1036-1042). (Proceedings of the National Conference on Artificial Intelligence; Vol. 2). AI Access Foundation.

A graphical representation for games in partition function form. / Skibski, Oskar; Michalak, Tomasz P.; Sakurai, Yuko; Wooldridge, Michael; Yokoo, Makoto.

Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. AI Access Foundation, 2015. p. 1036-1042 (Proceedings of the National Conference on Artificial Intelligence; Vol. 2).

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

Skibski, O, Michalak, TP, Sakurai, Y, Wooldridge, M & Yokoo, M 2015, A graphical representation for games in partition function form. in Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. Proceedings of the National Conference on Artificial Intelligence, vol. 2, AI Access Foundation, pp. 1036-1042, 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015, Austin, United States, 1/25/15.
Skibski O, Michalak TP, Sakurai Y, Wooldridge M, Yokoo M. A graphical representation for games in partition function form. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. AI Access Foundation. 2015. p. 1036-1042. (Proceedings of the National Conference on Artificial Intelligence).
Skibski, Oskar ; Michalak, Tomasz P. ; Sakurai, Yuko ; Wooldridge, Michael ; Yokoo, Makoto. / A graphical representation for games in partition function form. Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. AI Access Foundation, 2015. pp. 1036-1042 (Proceedings of the National Conference on Artificial Intelligence).
@inproceedings{96be31a7e2c5479c9642ba855b16f0c8,
title = "A graphical representation for games in partition function form",
abstract = "We propose a novel representation for coalitional games with externalities, called Partition Decision Trees. This representation is based on rooted directed trees, where non-leaf nodes are labelled with agents' names, leaf nodes are labelled with payoff vectors, and edges indicate membership of agents in coalitions. We show that this representation is fully expressive, and for certain classes of games significantly more concise than an extensive representation. Most importantly, Partition Decision Trees are the first formalism in the literature under which most of the direct extensions of the Shapley value to games with externalities can be computed in polynomial time.",
author = "Oskar Skibski and Michalak, {Tomasz P.} and Yuko Sakurai and Michael Wooldridge and Makoto Yokoo",
year = "2015",
month = "6",
day = "1",
language = "English",
series = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "AI Access Foundation",
pages = "1036--1042",
booktitle = "Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015",
address = "United States",

}

TY - GEN

T1 - A graphical representation for games in partition function form

AU - Skibski, Oskar

AU - Michalak, Tomasz P.

AU - Sakurai, Yuko

AU - Wooldridge, Michael

AU - Yokoo, Makoto

PY - 2015/6/1

Y1 - 2015/6/1

N2 - We propose a novel representation for coalitional games with externalities, called Partition Decision Trees. This representation is based on rooted directed trees, where non-leaf nodes are labelled with agents' names, leaf nodes are labelled with payoff vectors, and edges indicate membership of agents in coalitions. We show that this representation is fully expressive, and for certain classes of games significantly more concise than an extensive representation. Most importantly, Partition Decision Trees are the first formalism in the literature under which most of the direct extensions of the Shapley value to games with externalities can be computed in polynomial time.

AB - We propose a novel representation for coalitional games with externalities, called Partition Decision Trees. This representation is based on rooted directed trees, where non-leaf nodes are labelled with agents' names, leaf nodes are labelled with payoff vectors, and edges indicate membership of agents in coalitions. We show that this representation is fully expressive, and for certain classes of games significantly more concise than an extensive representation. Most importantly, Partition Decision Trees are the first formalism in the literature under which most of the direct extensions of the Shapley value to games with externalities can be computed in polynomial time.

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

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

M3 - Conference contribution

T3 - Proceedings of the National Conference on Artificial Intelligence

SP - 1036

EP - 1042

BT - Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015

PB - AI Access Foundation

ER -