Revising claims and resisting ultimatums in bargaining problems

We propose a mechanism which implements a unique solution to the bargaining problem with two players in subgame-perfect equilibrium. Players start by making claims and accept a compromise only if they cannot gain by pursuing their claim in an ultimatum. The player offering the lowest resistance to his opponent’s claim can propose a compromise. The unique solution depends on the extent to which claims can be revised. If no revisions are allowed, compatible claims implement the Nash solution. If all revisions are allowed, maximal claims implement the Kalai-Smorodinsky solution.

Revising claims and resisting ultimatums in bargaining problems.

We propose a mechanism which implements a unique solution to the bargaining problem with two players in subgame-perfect equilibrium. Players start by making claims and accept a compromise only if they cannot gain by pursuing their claim in an ultimatum. The player offering the lowest resistance to his opponent’s claim can propose a compromise. The unique solution depends on the extent to which claims can be revised. If no revisions are allowed, compatible claims implement the Nash solution. If all revisions are allowed, maximal claims implement the Kalai-Smorodinsky solution.

Revising claims and resisting ultimatums in bargaining problems

We propose a simple mechanism which implements a unique solution to the bargaining problem with two players in subgame-perfect equilibrium. The mechanism incorporates two important features of negotiations; players can revise claims in an attempt to reach a compromise or pursue their claims in an ultimate take-it-or-leave-it offer. Players restrain their claims to avoid a weak bargaining position or their resistance to uncompromising behavior to acquire leadership. The Nash solution and the Kalai–Smorodinsky solution are implemented in the extreme cases when respectively no and all revisions are allowed