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

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

Top responsiveness is introduced by Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] as a property which induces a rich domain on players's preferences in hedonic games, and guarantees the existence of core stable partitions. We strengthen this observation by proving the...

We study dynamic committee bargaining over an infinite horizon with discounting. In each period a committee proposal is generated by a random recognition rule, the committee chooses between the proposal and a status quo by majority rule, and the voting outcome in period t becomes the status quo...

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

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

This paper considers the object allocation problem introduced by Shapley and Scarf (1974). We study secure implementation (Saijo, Sjöström, and Yamato, 2007), that is, double implementation in dominant strategy and Nash equilibria. We prove that (i) an individually rational solution is...

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a "newcomer" in the...