close
Skip to main content
Log in

The least square nucleolus is a general nucleolus

  • Note
  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

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.

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 1998/Revised version: July 1999

Rights and permissions

Reprints 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

Download citation

  • Issue date:

  • DOI: https://doi.org/10.1007/s001829900028