A characterization of the Kalai–Smorodinsky bargaining solution by disagreement point monotonicity

2010 ◽  
Vol 40 (4) ◽  
pp. 691-696 ◽  
Author(s):  
Shiran Rachmilevitch
Author(s):  
Hans Peters

AbstractWe call a decision maker risk averse for losses if that decision maker is risk averse with respect to lotteries having alternatives below a given reference alternative in their support. A two-person bargaining solution is called invariant under risk aversion for losses if the assigned outcome does not change after correcting for risk aversion for losses with this outcome as pair of reference levels, provided that the disagreement point only changes proportionally. We present an axiomatic characterization of the Nash bargaining solution based on this condition, and we also provide a decision-theoretic characterization of the concept of risk aversion for losses.


2020 ◽  
Author(s):  
Barry Nalebuff

The Nash axioms lead to different results depending on whether the negotiation is framed in terms of gains relative to no agreement or in terms of sacrifices relative to an ideal. We look for a solution that leads to the same result from both perspectives. To do so, we restrict the application of Nash’s IIA axiom to bargaining sets where all options are individually rational and none exceed either party’s ideal point. If we normalize the bargaining set so that the disagreement point is (0, 0) and maximal gains are (1, 1), then any perspective-invariant bargaining solution must lie between the Utilitarian solution and the maximal equal-gain (minimal equal-sacrifice) solution. We show that a modified version of Nash’s symmetry axiom leads to the Utilitarian solution and that a reciprocity axiom leads to the equal-gain (equal-sacrifice) solution, both of which are perspective invariant. This paper was accepted by Joshua Gans, Business Strategy.


2002 ◽  
Vol 19 (4) ◽  
pp. 811-823 ◽  
Author(s):  
Nir Dagan ◽  
Oscar Volij ◽  
Eyal Winter

2017 ◽  
Vol 27 (4) ◽  
pp. 853-864 ◽  
Author(s):  
Julio B. Clempner ◽  
Alexander S. Poznyak

AbstractThis paper analyzes and proposes a solution to the transfer pricing problem from the point of view of the Nash bargaining game theory approach. We consider a firm consisting of several divisions with sequential transfers, in which central management provides a transfer price decision that enables maximization of operating profits. Price transferring between divisions is negotiable throughout the bargaining approach. Initially, we consider a disagreement point (status quo) between the divisions of the firm, which plays the role of a deterrent. We propose a framework and a method based on the Nash equilibrium approach for computing the disagreement point. Then, we introduce a bargaining solution, which is a single-valued function that selects an outcome from the feasible pay-offs for each bargaining problem that is a result of cooperation of the divisions of the firm involved in the transfer pricing problem. The agreement reached by the divisions in the game is the most preferred alternative within the set of feasible outcomes, which produces a profit-maximizing allocation of the transfer price between divisions. For computing the bargaining solution, we propose an optimization method. An example illustrating the usefulness of the method is presented.


2003 ◽  
Vol 3 (1) ◽  
Author(s):  
Manel Baucells ◽  
Steven A. Lippman

Abstract Our analysis (Baucells and Lippman [2001]) of the problem of legal hold-up in co-ownership, in which legal partition is the only remedy to force a sale, proceeded as if a sale of the asset could be effected at any time at a fixed price if the cotenants agree. Here we utilize the more realistic assumption that potential buyers appear intermittently (in accord with a Poisson process and that the price offered is drawn from a specified distribution). In applying the Nash bargaining solution, we select the disagreement point in accord either with Nash's methodology of rational threats or with reservation values. While neither methodology for selecting the disagreement point produces a credible threat when the agents incur legal costs, we argue that the rational threats approach produces more reasonable answers. Our main analysis considers the impact of a Poisson arrival of offers and an exponential time to court upon the optimal bargaining strategies of the cotenants.


2016 ◽  
Vol 18 (04) ◽  
pp. 1650013
Author(s):  
Michael R. Caputo

A generalization of the class of bargaining problems examined by Engwerda and Douven [(2008) On the sensitivity matrix of the Nash bargaining solution, Int. J. Game Theory 37, 265–279] is studied. The generalized class consists of nonconvex bargaining problems in which the feasible set satisfies the requirement that the set of weak Pareto-optimal solutions can be described by a smooth function. The intrinsic comparative statics of the aforesaid class are derived and shown to be characterized by a symmetric and positive semidefinite matrix, and an upper bound to the rank of the matrix is established. A corollary to this basic result is that a Nash bargaining solution is intrinsically a locally nondecreasing function of its own disagreement point. Other heretofore unknown results are similarly deduced from the basic result.


Sign in / Sign up

Export Citation Format

Share Document