Concise characteristic function representations in coalitional games based on agent types

Authors:
Suguru Ueda;Makoto Kitaki;Atsushi Iwasaki;Makoto Yokoo
Affiliations:
Kyushu University Motooka, Fukuoka, Japan;Kyushu University Motooka, Fukuoka, Japan;Kyushu University Motooka, Fukuoka, Japan;Kyushu University Motooka, Fukuoka, Japan
Venue:
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Year:
2011

Citing 4
Cited 0

Coalition structure generation with worst case guarantees

Artificial Intelligence
Marginal contribution nets: a compact representation scheme for coalitional games

Proceedings of the 6th ACM conference on Electronic commerce
Complexity of constructing solutions in the core based on synergies among coalitions

Artificial Intelligence
On agent types in coalition formation problems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.