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. We analyzed the properties those methods satisfy and we provide a characterization of them. We also prove that these...

We consider allocation problems with indivisible goods when agents’ preferences are single-peaked. Two natural procedures (up methods and temporary satisfaction methods) are proposed to solve these problems. They are constructed by using priority methods on the cartesian product of agents and...