= Nash bargaining solution
{c}
{title2=$\operatorname*{argmax}_{u\in F,\ u\geq d}(u_1-d_1)(u_2-d_2)$}
For an essential <Nash bargaining problem>, maximizing the <Nash product> gives a unique vector: on positive gains its logarithm is a <strictly concave function>. The rule satisfies the four bargaining axioms, and the <supporting triangle for Nash bargaining> proves their converse characterization. The nonessential case requires additional conventions, since a zero product may have many maximizers.
Back to article page
