Hybrid Dynamic Programming for Simultaneous Coalition Structure Generation and Assignment

We present, analyze and benchmark two algorithms for simultaneous coalition structure generation assignment: one based entirely on dynamic programming, anytime hybrid approach that uses branch-and-bound together with programming. To evaluate the algorithms’ performance, we them against both CPLEX (an industry-grade solver) state-of-the-art using difficult randomized data sets of varying distribution complexity. Our results show our algorithm greatly outperforms CPLEX, pure programming current in all benchmarks. For example, when solving most problem sets, finds optimum roughly \(0.1\%\) time best method needs, it generates \(98\%\) efficient interim solutions milliseconds benchmarks; a considerable improvement over what previous methods can achieve.