We consider allocation problemswith indivisible goods when preferences are single-peaked. In this paper we identify the family of efficient, non-manipulable, consistent, and balanced solutions. We refer those solutions as Temporary Satisfaction Methods, that can be viewed as extensions to the...

We consider allocation problemswith indivisible goods when preferences are single-peaked. In this paper we identify the family of efficient, non-manipulable, consistent, and balanced solutions. We refer those solutions as Temporary Satisfaction Methods, that can be viewed as extensions to the...

We study claims problems in which a certain amount of indivisible units (of an homogeneous good) has to be distributed among a group of agents, when this amount is not enough to fully satisfy agents' demands. We are interested in finding solutions satisfying robustness and fairness properties....