Abstract
A solution to bargaining problems is ordinal when it is covariant with respect to order-preserving transformations of utility. Shapley has constructed an ordinal, symmetric, efficient solution to three-player problems. Here, we extend Shapley's solution in two directions. First, we extend it to more than three players. Second, we show that this extension lends itself to the construction of a continuum of ordinal, symmetric, efficient solutions. The construction makes use of ordinal path-valued solutions that were suggested and studied by O'Neil et al. [Games Econ. Behav. 48 (2004) 139–153].
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.
