Threat bargaining problems with incomplete information

A framework for analyzing threat bargaining games with incomplete information is provided. Within this framework a characterization of the Kalai-Smorodinsky solution is obtained without any monotonicity assumption, together with the family of non-symmetric Nash bargaining solutions without the assumption of independence of irrelevant alternatives, given only that the beliefs of the players in a threat bargaining game are distributed uniformly. It is further argued the framework provided is genuinely general in terms of the class of bargaining problems for which it holds.