Nash solution and uncertain disagreement points

Abstract

We analyze bargaining problems with known feasible sets but uncertain disagreement points. We investigate the existence of solutions such that, under reasonably restricted circumstances, all agents be as well off by reaching an agreement today as they would be by waiting until the uncertainty is resolved. We use this requirement, together with a few other commonly used conditions, to characterize the Nash solution. © 1990.