In a moneyless market, a non storable, non transferable homogeneous commodity is reallocated between agents with single-peaked preferences. Agents are either suppliers or demanders. Transfers between a supplier and a demander are feasible only if they are linked, and the links form an arbitrary...

We prove a general possibility result for collective decision problems where individual allocations are one-dimensional, preferences are single-peaked (strictly convex), and feasible allocation profiles cover a closed convex set. Special cases include the celebrated median voter theorem (Black...

We consider the problem of fairly reallocating the individual endowments of a perfectly divisible good among agents with single-peaked preferences. We provide a new concept of fairness, called position-wise envy-freeness, that is compatible with individual rationality. This new concept requires...

The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function...

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by Sönmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In particular,...

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by S¨onmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In...

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by Sonmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In particular,...

We study the allocation problem of an indivisible object to one of several agents on the full preference domain when monetary transfers are not allowed. Our main requirement is strategy-proofness. The other properties we seek are Pareto optimality, non-dictatorship, and non-bossiness. We provide...

A new mechanism was introduced in New York City and Boston to assign students to public schools. This mechanism was advocated for its superior fairness property, besides others. We introduce a new framework for school-choice problems and two notions of fairness in lottery design based on ex-ante...

We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...