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

We identify a natural counterpart of the standard GARP for demand data in which goods are all indivisible. We show that the new axiom (DARP, for “discrete axiom of revealed preference”) is necessary and sufficient for the rationalization of the data by a well-behaved utility function. Our...

There are several locations, each of which is endowed with a resource that is specific to that location. Examples include coastal fisheries, oil fields, etc. Each agent will go to a single location and harvest some of the resource there. Several agents may go to each location. We assign...

We search for impartiality in the allocation of objects when monetary transfers are not possible. Our main focus is anonymity. The standard definition requires that if agents' names are permuted, their assignments should be permuted in the same way. Since no rule satisfies this definition in...

We review the theory of fairness as it pertains to concretely specified problems of resource allocations. We present punctual notions designed to evaluate how well individuals, or groups, are treated in relation to one another: no-envy, egalitarian-equivalence, individual and collective lower or...