= Maximin bargaining solution
{title2=$\operatorname*{argmax}_{u\in F,\ u\ge d}(u_1-d_1)(u_2-d_2)$}
For a finite two-person game, let $d_i$ be player $i$'s <security level payoff>, obtained by maximizing its minimum expected <payoff> against the other player's actions. Apply the <Nash bargaining solution> to the convexified feasible <payoff> region with this <disagreement point>. This is the <maximin bargaining solution>. “Maximin” specifies the disagreement guarantees; the arbitration <objective function> remains the <Nash product>, not the minimum of two numerically incomparable utilities.
Back to article page
