Constrained allocation problems with single-peaked preferences: an axiomatic analysis

Abstract

We introduce a new class of problems that contains two existing classes: allocation problems with single-peaked preferences and bankruptcy problems. On this class, we analyze the implications of well-known properties such as Pareto optimality, strategy-proofness, resource-monotonicity, no-envy, equal treatment of equals, and two new properties we introduce, hierarchical no-envy and independence of nonbinding constraints. Unlike earlier literature, we consider rules that allow free-disposability. We present characterizations of a rule we introduce on this domain. We relate this rule to well-known rules on the aforementioned subdomains. Based on this relation, we present a characterization of a well-known bankruptcy rule called the constrained equal awards rule.