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. In this paper we identify the family of efficient, fair and non-manipulable solutions. We refer to such a family as M-temporary satisfaction methods. Besides, we provide arguments to defend these...