Skip to main content
SpringerLink
Log in

A characterization of the leximin solution of the bargaining problem

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

We show that the lexicographic maximin solution is the only solution that satisfies the axioms of Pareto optimality, comprehensive hull axiom and duplicated individual monotonicity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, National Tsing Hua University, Hsinchu, Taiwan, , , , , , TW

    Chih Chang & Yan-An Hwang

Authors
  1. Chih Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan-An Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: December 1997/final version received: September 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, C., Hwang, YA. A characterization of the leximin solution of the bargaining problem. Mathematical Methods of OR 49, 395–400 (1999). https://doi.org/10.1007/s001860050056

Download citation

  • Issue Date:

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

Search

Navigation