This paper studies the problem of fairly allocating an amount of a divisible resource when preferences are single-peaked. We characterize the class of envy-free and peak-only rules and show that the class forms a complete lattice with respect to a dominance relation. We also pin down the...

In a single item auction model that allows non-quasilinear preferences, we show that an auction rule satisfies weak envy-freeness for equals, strategy-proofness, and nonimposition if and only if it is a (generalized) second price auction. This characterization is established on a wide class of...