{'fraction_non_alphanumeric': 0.021939953810623556, 'fraction_numerical': 0.008083140877598153, 'mean_word_length': 5.062937062937063, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Coalition Structure Formation using Parallel Dynamic Programming

Dynamic Programming (DP) is an effective procedure to solve many combinatorial optimization problems and optimal Coalition Structure generation (CSG) is one of them. Optimal CSG is an important combinatorial optimization problem with significant real-life applications. The current best result in terms of worst case time complexity isO(3n). So, there is a need to find speedy approaches. This paper proposes a parallel dynamic programming algorithm for optimal CSG. We performed the comparison of our algorithm with the DP for CSG problem which happens to be a sequential procedure. The theoretical, as well as the empirical results show that our proposed method works faster than its sequential counterpart. We obtain a speed-up that is almost 14 times in case of 17 agents using a 16-core machine.