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: v4 · 2026-09-19 · History
Domain-specific #: 2120
Domain group: Social Sciences
Origin domain: Economics & Finance
Subdomain: Cooperative Bargaining → Economics & Finance
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.

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.

How would you explain it like I'm…

Same-Fraction Sharing

Two kids are deciding how to share playtime. Each has a 'best I could ever hope for' and a 'what I get if we don't agree.' The Kalai–Smorodinsky way gives each kid the same fraction of the way from 'no deal' to their dream, going as far as they possibly can together.

Equal-Fraction Deal

The Kalai–Smorodinsky bargaining solution is a rule for settling a deal between two people. First you note what each gets if they don't agree, and the best each could possibly get. Then you pick the deal where both have moved the same fraction of the way from 'no agreement' toward their best, and you push that as far as possible so nothing is wasted. A key idea is fairness when options grow: if one person gets more possibilities without hurting the other's possibilities, that person shouldn't end up with less.

Proportional-Gains Bargaining Solution

The Kalai–Smorodinsky bargaining solution chooses an outcome for a two-person cooperative bargain by equalizing proportional gains. You start with the set of achievable utility pairs, a disagreement point d (what each gets with no deal), and an ideal point b (each player's own maximum attainable payoff). The solution is the efficient point on the straight line from d toward b, so each player gets the same fraction of their possible gain. It differs from the Nash bargaining solution by dropping Nash's independence of irrelevant alternatives and using monotonicity instead: if one player's opportunities expand and the other's frontier is unharmed, the first player's outcome shouldn't fall.

The Kalai–Smorodinsky bargaining solution maps a two-person bargaining problem to an outcome by equalizing proportional gains. The problem consists of a feasible utility set F ⊆ R², a disagreement point d, and an ideal point b whose coordinates are each player's maximum separately attainable utility. The solution selects the Pareto-efficient feasible point on the ray from d toward b. Equivalently, it finds the largest common t such that d + t(b − d) is still feasible, so both players achieve the same fraction t of their potential gain. Axiomatically, it replaces Nash's independence of irrelevant alternatives with a monotonicity axiom. Monotonicity requires that enlarging one player's opportunities, without harming the other's opportunity frontier, never reduces the first player's selected utility.

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. Moulin uses the geometry to contrast solution concepts and distributive principles.

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¶

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

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.

Relationships to Other Abstractions¶

Current abstraction Kalai–Smorodinsky Bargaining Solution Domain-specific

Parents (1) — outgoing typed relations

Kalai–Smorodinsky Bargaining Solution is a kind of Allocation Prime

Allocation is the broader abstraction this entry instantiates.

Hierarchy path (1) — routes to 1 parentless root

Kalai–Smorodinsky Bargaining Solution → is a kind of Allocation → presupposes Scarcity → is a decomposition of Constraint

Neighborhood in Abstraction Space¶

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

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25