= Nash bargaining problem
{c}
{title2=$(F,d)$}
The essential two-person bargaining domain consists of a <compact convex set> of feasible utility vectors $F$, a <disagreement point> $d\in F$, and at least one feasible vector strictly exceeding $d$ 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>.
Back to article page
