Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
Published Online:1 Aug 1996https://doi.org/10.1287/moor.21.3.757
Abstract
This paper describes a fast algorithm to find the nucleolus of any game with a nonempty imputation set. It is based on the algorithm scheme of Maschler et al. (Maschler, M., J. Potters, S. Tijs. 1992. The general nucleolus and the reduced game property. Internal. J. Game Theory21 83–106.) for the general nucleolus.
