Abstract
In this paper, we consider the least core, its related solution, and the nucleolus in n-person cooperative games with fuzzy coalitions. Since there are an infinite number of inequality constraints for fuzzy coalitions in the mathematical programming problem for obtaining the least core, it is difficult to directly solve the problem. We employ a computational method based on the relaxation method, which repeatedly solves mathematical programming problems with a part of the inequality constraints. The nucleolus is considered in the case where there are a finite number of fuzzy coalitions, and the nucleolus based on aggregated excesses is also examined.
