Abstract

We consider the problem of allocating a finite set of indivisible goods and a single infinitely divisible good among a group of agents, and we study a solution, called the Identical Preferences Lower Bound solution, in the presence of consistency properties. This solution is not consistent. We prove that its maximal consistent subsolution is the No-envy solution. Our main result is that the minimal consistent extension of the intersection of the Identical Preferences Lower Bound solution with the Pareto solution is the Pareto solution. This result remains true in the restricted domain when all the indivisible goods are identical, but not when there is a unique indivisible good.

Full Text
Paper version not known

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 call

Disclaimer: 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.