The article introduces a new algorithm, CoreD, to check if a coalition structure has a core. This algorithm is more efficient than the existing one, CoreP, when the core is empty. The researchers also suggest a new concept, weak ε-core+, to find the second-best payoff when the core is empty. Their approach aims to improve the process of forming coalition structures among agents.