We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We completely describe all rules satisfying efficiency, independence of irrelevant objects, and...

We consider a probabilistic approach to the problem of assigning k indivisible identical objects to a set of agents with single-peaked preferences. Using the ordinal extension of preferences we characterize the class of uniform probabilistic rules by Pareto efficiency, strategy-proofness, and...

We consider a probabilistic approach to collective choice problems where a group of agents with single-peaked preferences have to decide on the level or location of a public good. We show that every probabilistic rule that satisfies Pareto efficiency and "solidarity" (population-monotonicity or...