Abstract
We consider allocation problems with indivisible goods when agents’ preferences are single-peaked. We propose natural rules (called up methods) to solve such a class of problems and axiomatically characterize them. We also prove that these methods can be interpreted as extensions to the indivisible case of the so-called equal distance rule.
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.
