Simple Coalitional Games with Beliefs
Chalkiadakis, Georgios, Elkind, Edith and Jennings, Nick (2009) Simple Coalitional Games with Beliefs. In, Proc 21st Int. Joint Conf on AI (IJCAI), Pasadena, USA, , 85-90.
- Accepted Version
We introduce coalitional games with beliefs (CGBs), a natural generalization of coalitional games to environments where agents possess private beliefs regarding the capabilities (or types) of others. We put forward a model to capture such agent-type uncertainty, and study coalitional stability in this setting. Specifically, we introduce a notion of the core for CGBs, both with and without coalition structures. For simple games without coalition structures, we then provide a characterization of the core that matches the one for the full information case, and use it to derive a polynomial-time algorithm to check core nonemptiness. In contrast, we demonstrate that in games with coalition structures allowing beliefs increases the computational complexity of stability-related problems. In doing so, we introduce and analyze weighted voting games with beliefs, which may be of independent interest. Finally, we discuss connections between our model and other classes of coalitional games.
|Item Type:||Conference or Workshop Item (Paper)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||07 Apr 2009 15:11|
|Last Modified:||01 Mar 2012 16:53|
|Contributors:||Chalkiadakis, Georgios (Author)
Elkind, Edith (Author)
Jennings, Nick (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||0|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)