If an admissible smaller feasible set with the same disagreement point contains the original chosen vector, deleting the other outcomes must leave the choice unchanged. The Nash bargaining solution satisfies this axiom because its unique product maximizer remains feasible.
Nash bargaining problem 2026-10-07
The essential two-person bargaining domain consists of a compact convex set of feasible utility vectors , a disagreement point , and at least one feasible vector strictly exceeding coordinatewise. The Nash bargaining solution selects a jointly feasible improvement using a rule characterized by Pareto efficiency, bargaining symmetry, positive affine invariance in bargaining and bargaining independence of irrelevant alternatives.
Nash product 2026-10-07
The product of the two players' gains over the disagreement point is maximized over the individually rational feasible set in the Nash bargaining solution. Positive affine changes of utility multiply this product by a positive constant and leave the selected payoff correspondence unchanged after transforming coordinates.
Pareto frontier 2026-10-07
The Pareto frontier consists of feasible payoff vectors that no other feasible vector weakly improves in every coordinate and strictly improves in at least one. A Nash bargaining solution with positive gains lies on this frontier, because increasing either gain without decreasing the other raises its Nash product.
Use the usual essential two-person Nash bargaining problem: is a compact convex set, is the disagreement point, and some satisfies for both players. The Nash bargaining solution is
The positive maximum exists by compactness and essentiality. On positive gains, maximizing this Nash product is equivalent to maximizing , a strictly concave function. Convexity then gives a unique maximizer. The essentiality and compactness hypotheses matter: for example, with and , the product is zero everywhere and its argmax alone is not a single-valued definition.
The rule satisfies all four axioms. Pareto efficiency: a feasible vector dominating the chosen vector with at least one strict improvement would increase its positive Nash product. Bargaining symmetry: if the problem is unchanged by swapping players, uniqueness makes the answer unchanged, so the two payoffs agree. Positive affine invariance in bargaining: for with , gains transform to and the product is multiplied by the positive constant , preserving its maximizer. Bargaining independence of irrelevant alternatives: if is another admissible feasible set containing the chosen vector and the same disagreement point, that vector remains the unique product maximizer over .
To prove characterization, let be any feasible single-valued rule satisfying these axioms, and let . Normalize payoffs by the positive affine transformation
The transformed set has disagreement point zero and product maximizer . For any , convexity puts in ; for sufficiently small both gains remain positive. The one-sided derivative of the product at its maximum is therefore nonpositive:
Thus . By compactness choose so every coordinate of every is at least . The supporting triangle for Nash bargaining is
It contains , is compact, convex, symmetric and essential, and contains disagreement zero. Symmetry forces onto the diagonal; Pareto efficiency then forces it to be . Since , bargaining independence of irrelevant alternatives gives . Undoing the normalization by positive affine invariance in bargaining gives . Hence the four axioms uniquely characterize the Nash bargaining solution on this domain.
Transforming each utility by an independent positive affine map must transform the chosen payoff by the same map. The Nash product changes only by a positive factor, so the Nash bargaining solution has this invariance.