Abstract
We introduce log-convexity for bargaining problems. With the requirement of some basic regularity conditions, log-convexity is shown to be necessary and sufficient for Nash's axioms to determine a unique single-valued bargaining solution up to choices of bargaining powers. Specifically, we show that the single-valued (asymmetric) Nash solution is the unique solution under Nash's axioms without that of symmetry on the class of all regular and log-convex bargaining problems, but this is not true on any larger class. We apply our results to bargaining problems arising from duopoly and the theory of the firm. These problems turn out to be log-convex but not convex under familiar conditions. We compare the Nash solution for log-convex bargaining problems with some of its extensions in the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
