On the Complexity of Compact Coalitional Games
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 147-151.
Abstract
A significantly complete account of the complexity underlying the computation of relevant solution concepts in compact coalitional games is provided. The starting investigation point is the setting of graph games, about which various long-standing open problems were stated in the literature. The paper gives an answer to most of them, and in addition provides new insights on this setting, by stating a number of complexity results about some relevant generalizations and specializations. The presented results also pave the way towards precisely carving the tractability frontier characterizing computation problems on compact coalitional games.Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello
@inproceedings{ijcai2009p35,
title = {On the Complexity of Compact Coalitional Games},
author = {Greco, Gianluigi and Malizia, Enrico and Palopoli, Luigi and Scarcello, Francesco},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {147--151},
year = {2009},
url = {https://ijcai.org/proceedings/2009/35},
}
TY - CPAPER TI - On the Complexity of Compact Coalitional Games AU - Greco, Gianluigi AU - Malizia, Enrico AU - Palopoli, Luigi AU - Scarcello, Francesco T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 147 EP - 151 UR - https://ijcai.org/proceedings/2009/35 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
