Concise Characteristic Function Representations in Coalitional Games Based on Agent Types
Abstract
Forming effective coalitions is a major research challenge in AI and multi-agent systems. Thus, coalitional games, including coalition structure generation, have been attracting considerable attention from the AI research community. Traditionally, the input of a coalitional game is a black-box function called a characteristic function. In this paper, we develop a new concise representation scheme for a characteristic function, which is based on the idea of agent types. This representation can be exponentially more concise than existing concise representation schemes. Furthermore, this idea can be used in conjunction with existing schemes to further reduce the representation size.
Cite
Text
Ueda et al. "Concise Characteristic Function Representations in Coalitional Games Based on Agent Types." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-074Markdown
[Ueda et al. "Concise Characteristic Function Representations in Coalitional Games Based on Agent Types." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/ueda2011ijcai-concise/) doi:10.5591/978-1-57735-516-8/IJCAI11-074BibTeX
@inproceedings{ueda2011ijcai-concise,
title = {{Concise Characteristic Function Representations in Coalitional Games Based on Agent Types}},
author = {Ueda, Suguru and Kitaki, Makoto and Iwasaki, Atsushi and Yokoo, Makoto},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2011},
pages = {393-399},
doi = {10.5591/978-1-57735-516-8/IJCAI11-074},
url = {https://mlanthology.org/ijcai/2011/ueda2011ijcai-concise/}
}