Abstract:
Two one-pointed solutions of cooperative games with transferable utility: the prenucleolus and the SM-Nucleolus, are presented in this article. New algorithms of finding these solutions based on the procedure, described in the paper of M. Maschler, B. Peleg and L. S. Shapley, are proposed in this article. Introducing the numbering of the coalitions provides finding solution with the use of only one iteration of the procedure.
Keywords:cooperative game, effectively rational distribution, lexicographical minimum, excess, the prenucleolus, biexcess, the SM-nucleolus.