person non-convex bargaining: Efficient proportional solutions (original) (raw)
Proportional Nash solutions - A new and procedural analysis of nonconvex bargaining problems
This paper studies the Nash solution to nonconvex bargaining problems. The Nash solution in such a context is typically multi-valued. We introduce a procedure to exclude some options recommended by the Nash solution. The procedure is based on the idea of the Kalai-Smorodinsky solution which has the same informational requirement on individual utilities as the Nash solution does and has an equity consideration as well. We then use this procedure to introduce two new solutions to nonconvex bargaining problems and study them axiomatically.
WPO, COV and IIA bargaining solutions for non-convex bargaining problems
International Journal of Game Theory, 2012
We characterize all n-person multi-valued bargaining solutions, defined on the domain of all finite bargaining problems, and satisfying Weak Pareto Optimality (WPO), Covariance (COV), and Independence of Irrelevant Alternatives (IIA). We show that these solutions are obtained by iteratively maximizing nonsymmetric Nash products and determining the final set of points by so-called LDR decompositions. If, next, we assume the (set-theoretic) Axiom of Determinacy, then this class coincides with the class of iterated Nash bargaining solutions; but if we assume the Axiom of Choice then we are able to construct an additional large set of discontinuous and even nonmeasurable solutions. We show however that none of these nonmeasurable solutions can be defined in terms of set theoretic formulae. We next show that a number of existing results in the literature as well as some new results are implied by our approach. These include a characterization of all WPO, COV and IIA solutions -including single-valued ones -on the domain of all compact bargaining problems, and an extension of a theorem of Birkhoff characterizing translation invariant and homogeneous orderings.
Economics Letters, 2010
We provide three alternative characterizations of the proportional solution defined on compact and comprehensive bargaining problems with claims that are not necessarily convex. One characterization result is obtained by using, together with other standard axioms, two solidarity axioms. Another characterization theorem shows that the single-valuedness axiom is dispensable even within the class of nonconvex problems if the standard symmetry axiom is imposed.
Characterization and Implementation of Nash Bargaining Solutions with Non-Convexity
Social Science Research Network, 2017
We consider bargaining problems with compact star-shaped choice sets arising from a class of economic bargaining environments. Convex or comprehensive (relative to the disagreement point) problems are star-shaped but not conversely. We characterize single-valued solutions satisfying the Nash axioms on the class of compact star-shaped bargaining problems. For the case with two players, we show that there are exactly two solutions with each being a dictatorial (in favor of one player) selection of Nash product maximizers. We provide an extensive form game to implement Nash bargaining solutions. We extend our analysis and results to allow for alternative domains, asymmetries, and more than two players. For the n-player case, Nash solutions are shown to be determined by n-round iterative maximizations of Nash products.
Nonconvex n -person bargaining: efficient maxmin solutions
Economic Theory, 2003
This paper provides an axiomatic characterization of a family of socalled efficient maxmin solutions which can be seen as generalizations of the Kalai-Smorodinsky solution to nonconvex n-person bargaining problems. Moreover, it is shown that even though there are several efficient maxmin solutions for some bargaining problems, there is typically a unique efficient maxmin solution.
Nash Bargaining Theory with Non-Convexity and Unique Solution
2009
We characterize a class of bargaining problems allowing for non-convexity on which all of Nash axioms except for that of symmetry uniquely characterize the asymmetric Nash bargaining solution. We show that under some basic conditions, the uniqueness of the solution is equivalent to the choice sets of the bargaining problems being “log-convex”. The well-recognized non-convex bargaining problems arising from duopolies with asymmetric constant marginal costs turn out to belong to this class. We compare the Nash bargaining solution with some of its extensions that appeared in the literature.
Single-Valued Nash Bargaining Solutions with Non-Convexity ∗
2018
We consider two-player bargaining problems with compact star-shaped choice sets arising from a class of economic environments. We characterize single-valued solutions satisfying the Nash axioms on this class of bargaining problems. Our results show that there are exactly two Nash solutions with each being a dictatorial (in favor of one player) selection of Nash product maximizers. We also provide an extensive form for implementing these two Nash solutions.
The Kalai–Smorodinsky bargaining solution with loss aversion
Mathematical Social Sciences, 2011
We consider bargaining problems under the assumption that players are loss averse, i.e., experience disutility from obtaining an outcome lower than some reference point. We follow the approach of Shalev (2002) by imposing the self-supporting condition on an outcome: an outcome z in a bargaining problem is self-supporting under a given bargaining solution, whenever transforming the problem using outcome z as a reference point, yields a transformed problem in which the solution is z.
An equitable solution for multicriteria bargaining games
European Journal of Operational Research, 2007
In this paper we study bargaining models where the agents consider several criteria to evaluate the results of the negotiation process. We propose a new solution concept for multicriteria bargaining games based on the distance to a utopian minimum level vector. This solution is a particular case of the class of the generalized leximin solutions and can be characterized as the solution of a finite sequence of minimax programming problems.
Efficient solutions to bargaining problems with uncertain disagreement points
Social Choice and Welfare, 2002
We consider a cooperative model of bargaining where the location of the disagreement point may be uncertain. Based on the maximin criterion, we formulate an ex ante efficiency condition and characterize the class of bargaining solutions satisfying this axiom. These solutions are generalizations of the monotone path solutions. Adding individual rationality yields a subclass of these solutions. By employing maximin efficiency and an invariance property that implies individual rationality, a new axiomatization of the monotone path solutions is obtained. Furthermore, we show that an efficiency axiom employing the maximax criterion leads to an impossibility result.