Computing optimal coalition structures in polynomial time

The optimal coalition structure determination problem is in general computationally hard. In this article, we identify some problem instances for which the space of possible coalition structures has a certain form and constructively prove that the problem is polynomial time solvable. Specifically, w...

Full description

Bibliographic Details

Main Authors:	Syeda Fatima, Michael Wooldridge
Format:	Default Article
Published:	2018
Subjects:	Artificial intelligence not elsewhere classified Software engineering not elsewhere classified Other information and computing sciences not elsewhere classified untagged Artificial Intelligence and Image Processing Information and Computing Sciences not elsewhere classified Computer Software
Online Access:	https://hdl.handle.net/2134/35724
Tags:	Add Tag No Tags, Be the first to tag this record!