Bargaining with set-valued disagreement
β Scribed by Kaushik Basu
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 780 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0176-1714
No coin nor oath required. For personal study only.
β¦ Synopsis
It is arguable that in many-two person bargaining situations disagreement leads to a set of possible payoffs with no probabilities attached to the elements of the set. Axioms are developed for bargaining games of this kind and solution concepts are derived from these axioms. Particular attention is paid to what are here called the "max-max" and "rectangular general" solutions. The latter can be applied to an important sub-class of bargaining games where the disagreement set is equal to the feasible set.
π SIMILAR VOLUMES
This paper provides an axiomatization of the egalitarian bargaining solution. The central axiom used (together with some standard properties of bargaining solutions) in this characterization is a transfer responsiveness condition. First, it ensures that no transfer paradox can occur if bargaining po