Transferable Utility Planning Games
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.
Cite
Text
Brafman et al. "Transferable Utility Planning Games." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7605Markdown
[Brafman et al. "Transferable Utility Planning Games." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/brafman2010aaai-transferable/) doi:10.1609/AAAI.V24I1.7605BibTeX
@inproceedings{brafman2010aaai-transferable,
title = {{Transferable Utility Planning Games}},
author = {Brafman, Ronen I. and Domshlak, Carmel and Engel, Yagil and Tennenholtz, Moshe},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2010},
pages = {709-714},
doi = {10.1609/AAAI.V24I1.7605},
url = {https://mlanthology.org/aaai/2010/brafman2010aaai-transferable/}
}