Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory

The algorithm for finding the nucleolus of a cooperative n-person-game introduced by Sankaran is compared to an earlier procedure by Behringer. It turns out that the latter is in every respect the superior one. In both concepts the computation of the nucleolus is reduced to the solution of a finite sequence of linear programs. Their number is O(2ⁿ). A method of reducing the number of linear programs to O(n) while not changing their size will be introduced.