No Price Envy in the Multi-unit Object Allocation Problem with Non-quasi-linear Preferences

We consider the problem of allocating multiple units of an indivisible object among a set of agents and collecting payments. Each agent can receive multiple units of the object. We assume that preferences exhibit both nonincreasing marginal valuations and nonnegative income effects.We propose a new property of fairness: no price envy. It extends the no envy test (Foley, 1967) over bundles to prices (per-unit payments), and requires no agent envy other agents' prices to his own in the sense that if he has a chance to receive some units at other agents' prices, then he gets better off than his own bundle.First, we show that the inverse uniform-price rule is the only rule satisfying no price envy and no subsidy for losers. Then, we identify the unique maximal domain for no price envy, strategy-proofness, and no subsidy for losers: the domain with partly constant marginal valuations. We further establish that on the domain with partly constant marginal valuations, the minimum inverse uniform-price rule is the only rule satisfying no price envy, strategy-proofness, and no subsidy for losers.Our maximal domain result implies no rule satisfies no price envy, strategy-proofness, and no subsidy for losers when agents have preferences with nonincreasing marginal valuations. Given this negative observation, we look for a minimally manipulable rule among the class of rules satisfying both no price envy and no subsidy for losers in the case of preferences with nonincreasing marginal valuations. We show that the minimum inverse uniform-price rule is the only minimally manipulable rule among the class of rules satisfying no price envy and no subsidy for losers. Our results provide a rationale for the use of the popular minimum uniform-price rule in terms of fairness and non-manipulability