RUS  ENG
Full version
JOURNALS // Matematicheskaya Teoriya Igr i Ee Prilozheniya // Archive

Mat. Teor. Igr Pril., 2013 Volume 5, Issue 4, Pages 14–32 (Mi mgta119)

This article is cited in 1 paper

Algorithms of finding the prenucleolus and the SM-nucleolus of cooperative TU-games

Sergei V. Britvin, Svetlana I. Tarashnina

Saint-Petersburg State University

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.

UDC: 519.83
BBK: 22.18



© Steklov Math. Inst. of RAS, 2024