Abstract.
This short note proves that the least square nucleolus (Ruiz et al. (1996)) and the lexicographical solution (Sakawa and Nishizaki (1994)) select the same imputation in each game with nonempty imputation set. As a consequence the least square nucleolus is a general nucleolus (Maschler et al. (1992)).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 1998/Revised version: July 1999
Rights and permissions
About this article
Cite this article
Molina, E., Tejada, J. The least square nucleolus is a general nucleolus. Game Theory 29, 139–142 (2000). https://doi.org/10.1007/s001829900028
Issue Date:
DOI: https://doi.org/10.1007/s001829900028