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

I consider the problem of assigning agents to indivisible objects, in which each agent pays a price for his object and all prices sum to a given constant. The objective is to select an assignment-price pair that is envy-free with respect to the agents' true preferences. I propose a simple...