Central to this endeavour is the problem of partitioning the set of agents into exhaustive and disjoint coalitions such that the social welfare is maximized.

Figure 1: The DP algorithm for coalition structure generation. Once f1 and f2 are computed for every coalition, the optimal coalition structure, denoted CS ...

In this paper, we devise an Improved Dynamic Programming algo- rithm (IDP) that is proven to perform fewer operations than DP (e.g. 38.7% of the operations ...

In this paper, we devise an Improved Dynamic Programming algorithm (IDP) that is proved to perform fewer operations than DP (e.g. 38.7% of the operations given ...

Mar 14, 2024 · In this paper, we devise an Improved Dynamic Programming algorithm (IDP) that is proven to perform fewer operations than DP (eg 38.7% of the operations given ...

The fastest exact algorithm to solve this combinatorial optimization problem is ODP-IP [1], which is a hybrid version of two previously established algorithms, ...

Jul 1, 2019 · The fastest exact algorithm to solve the CSG problem is ODP-IP, which is a hybrid version of two previously established algorithms, namely ...

Oct 11, 2024 · We present a new Dynamic Programming (DP) formulation of the Coalition Structure Generation (CSG) problem based on imposing a hierarchical ...

The state of the art in this class of algorithms is the IDP algorithm (Rahwan & Jen- nings 2008), which improves on the widely-used dynamic programming (DP) ...

A novel algorithm is developed that combines both IDP and IP, resulting in a hybrid performance that exploits the strength of both algorithms and, at the same, ...