پیدا کردن هسته از هر بازی تعاونی N-فرد توسط یک برنامه تک خطی

In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with O(4n)O(4n) constraints whose coefficients belong to {−1,0,1}{−1,0,1}. We discuss the need of having all these constraints and empirically prove that they can be reduced to O(kmax2n)O(kmax2n), where kmax is a positive integer comparable with the number of players. A computational experience shows the applicability of our method over (pseudo)random transferable utility cooperative games with up to 18 players.