Transferable utility planning games

Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

Connecting between standard AI planning constructs and a classical cooperative model of transferable-utility coalition games, we introduce the notion of transferable-utility (TU) planning games. The key representational property of these games is that coalitions are valued implicitly based on their ability to carry out efficient joint plans. On the side of the expressiveness, we show that existing succinct representations of monotonic TU games can be efficiently compiled into TU planning games. On the side of computation, TU planning games allow us to provide some of the strongest to date tractability results for core-existence and core-membership queries in succinct TU coalition games.

Original languageEnglish
Title of host publicationAAAI-10 / IAAI-10 - Proceedings of the 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference
PublisherAI Access Foundation
Pages709-714
Number of pages6
ISBN (Print)9781577354659
StatePublished - 1 Jan 2010
Event24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, AAAI-10 / IAAI-10 - Atlanta, GA, United States
Duration: 11 Jul 201015 Jul 2010

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume2

Conference

Conference24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, AAAI-10 / IAAI-10
Country/TerritoryUnited States
CityAtlanta, GA
Period11/07/1015/07/10

Fingerprint

Dive into the research topics of 'Transferable utility planning games'. Together they form a unique fingerprint.

Cite this