original papers : Bargaining solutions with non-standard objectives

I examine the pure-strategy solutions of the sealed-bid bargaining game with incomplete information, when the buyer's and seller's objectives are other than the standard objective, namely maximization of expected profit. The motivation for this exploration lies in three problems of the standard formulation: the necessity of assuming common priors, the existence of uncountably many Nash equilibria, with no means for the players to coordinate on any one of them, and the uncertain relationship between these equilibria and observed behavior in bargaining experiments. Specifically, I consider two alternative objectives: minimization of maximum regret, and maximization of maximum profit. The solution concept here is not Nash equilibrium, but rather $\alpha$-individually rational strategy bundle. For that reason, I shall, where appropriate, use the word "solution" in place of "equilibrium." Yet we find that the notion of Nash Equilibrium reappears, in a sense to be explained. In the minimax-regret case I find (in contrast to the case of expected profit) a unique solution; this solution reduces, for priors with coincident support, to the linear equilibrium of Chatterjee-Samuelson. In the maximum-profit case there are many solutions; they turn out to be slight generalizations of the one-step equilibria of Leininger-Linhart-Radner.