Up methods in the allocation of indivisibilities when preferences are single-peaked

摘要

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.