Skip to content

Kalai–Smorodinsky Bargaining Solution

Select the Pareto-efficient feasible agreement that equalizes each bargainer's gain above disagreement as a proportion of that bargainer's maximum feasible gain.

Version
v3 · 2026-09-06 · History
Domain-specific #
2120
Origin domain
economics
Subdomain
cooperative bargaining
Aliases
KS bargaining solution, Kalai-Smorodinsky solution, Proportional-gains bargaining solution

Core Idea

The Kalai–Smorodinsky bargaining solution assigns a cooperative two-person bargain by equalizing proportional gains. Given a feasible utility set \(F\subseteq\mathbb R^2\), disagreement point (d), and ideal point (b) whose coordinates are the players' separately attainable maxima, it selects the Pareto-efficient feasible point on the ray from (d) toward (b). Equivalently, it maximizes a common (t) such that (d+t(b-d)) remains feasible.[1]

It replaces Nash's independence of irrelevant alternatives with a monotonicity principle: expanding opportunities for one player without harming the other's opportunity frontier should not reduce the first player's selected utility.

Structural Signature

  • Two bargainers represented by von Neumann–Morgenstern utilities.
  • A closed feasible utility set, conventionally convex and comprehensive.
  • A disagreement payoff reached if bargaining fails.
  • A nontrivial individually rational region above disagreement.
  • A componentwise ideal or utopia point, possibly infeasible jointly.
  • A ray from disagreement toward that ideal point.
  • A maximal feasible common proportion of ideal gains.
  • Selection on the Pareto frontier.
  • Symmetry and positive-affine utility invariance.
  • Resource monotonicity rather than independence of irrelevant alternatives.

What It Is Not

It is not the Nash bargaining solution, which maximizes a product of gains and is characterized using independence of irrelevant alternatives. It is not equal division of money, because proportional equality is measured in each player's utility-gain range. The ideal point need not itself be feasible, and the construction is not a noncooperative protocol unless a separate implementation game is supplied.

Scope of Application

The rule is used to compare normative bargaining solutions, allocate jointly produced surplus, and study how changes in feasible opportunities should affect negotiated outcomes. Thomson situates it among axiomatic cooperative bargaining models and their extensions.[2] Moulin uses the geometry to contrast solution concepts and distributive principles.[3]

Clarity

State the feasible-set assumptions, disagreement point, utility normalization, ideal-point construction, and whether the frontier intersects the ideal ray uniquely. Distinguish weak and strong Pareto efficiency and specify any extension used for nonconvex sets, more than two players, or asymmetric claims.

Manages Complexity

The method compresses a continuum of feasible agreements into three geometric objects: disagreement, ideal point, and Pareto frontier. It makes the distributive commitment visible: each player receives the same fraction of the best gain they could individually hope to achieve.

Abstract Reasoning

  1. Represent feasible agreements in utility space.
  2. Fix the no-agreement payoff (d).
  3. Restrict attention to individually rational outcomes.
  4. Compute each player's maximum feasible utility and form (b).
  5. Parameterize proportional gains as (d+t(b-d)).
  6. Increase (t) until feasibility ends.
  7. Select the maximal feasible point and verify Pareto efficiency.
  8. Test how the selection moves when resources or feasible opportunities expand.

Raiffa's earlier bargaining procedures supplied a proportional-concession line of development that the axiomatic solution made precise.[4]

Knowledge Transfer

The portable pattern is normalize each claimant's gain by its own opportunity ceiling, then advance all claimants at the same normalized rate until feasibility binds. It transfers to fair resource allocation. The proposed immediate parent is Allocation.

Examples

If disagreement is ((0,0)), individual maxima are ((10,20)), and the Pareto frontier meets the ray ((10t,20t)) at (t=0.6), the solution is ((6,12)). The raw utilities differ, but both obtain 60% of their maximum feasible gains.

Expanding the feasible set can move the ideal point and the intersection even when the old chosen point remains available. This is intentional and explains why the rule violates Nash's independence axiom.

Structural Tensions

  • Proportional aspiration gains versus Nash-product gains.
  • Resource monotonicity versus irrelevant-alternative independence.
  • Individually attainable ideals versus joint feasibility.
  • Utility invariance versus interpersonal comparison.
  • Axiomatic recommendation versus strategic implementation.

Structural–Framed Character

Ray intersection, normalized progress, and frontier binding are structural. Bargaining utilities, disagreement, feasible lotteries, and axiomatic welfare interpretation are constitutive. The identity is domain-specific.

Structural Core vs. Domain Accent

The structural core is baseline -> claimant-specific ceiling -> equal normalized progress -> binding frontier. The domain accent is cooperative utility bargaining.

Allocation is the proposed immediate parent. Fairness, Proportionality, Pareto Efficiency, Bargaining Power, and Symmetry are related primes.

The prospective queue contains one strict edge to prime:allocation. No live DAG mutation is authorized.

Relationships to Other Abstractions

Local relationship map for Kalai–Smorodinsky Bargaining SolutionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Kalai–SmorodinskyBargaining SolutionDOMAINPrime abstraction: Allocation — is a kind ofAllocationPRIME

Current abstraction Kalai–Smorodinsky Bargaining Solution Domain-specific

Parents (1) — more general patterns this builds on

  • Kalai–Smorodinsky Bargaining Solution is a kind of Allocation Prime

    Allocation is the proposed immediate parent.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Kalai–Smorodinsky Bargaining Solution sits in a sparse region of the domain-specific corpus (89th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With

  • Nash bargaining solution.
  • Equal split of transferable utility.
  • Leximin allocation.
  • Proportional fairness in network optimization.
  • Raiffa's discrete bargaining procedure.
  • A noncooperative equilibrium without an implementation theorem.

References

[1] Ehud Kalai and Meir Smorodinsky, “Other Solutions to Nash's Bargaining Problem,” Econometrica 43, no. 3 (1975): 513–518, doi:10.2307/1914280. registry ↩

[2] William Thomson, “Cooperative Models of Bargaining,” in Handbook of Game Theory with Economic Applications, vol. 2 (Elsevier, 1994), 1237–1284, doi:10.1016/S1574-0005(05)80067-0. registry ↩

[3] Hervé Moulin, Fair Division and Collective Welfare (MIT Press, 2003), 88–92. registry ↩

[4] Howard Raiffa, “Arbitration Schemes for Generalized Two-Person Games,” in Contributions to the Theory of Games II (Princeton University Press, 1953), 361–387. registry ↩