We consider the problem of randomly assigning n indivisible objects to n agents. Recent research introduced a promising mechanism, the probabilistic serial that has superior efficiency properties than the most common real-life mechanism random priority. On the other hand, mechanisms based on...

It is well known that the core of an exchange market with indivisible goods is always non empty, although it may contain Pareto inecient allocations. The strict core solves this shortcoming when indiff erences are not allowed, but when agents' preferences are weak orders the strict core may be...

A multiple-partners assignment game with heterogeneous sells and multi-unit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...

We identify a natural counterpart of the standard GARP for demand data in which goods are all indivisible. We show that the new axiom (DARP, for “discrete axiom of revealed preference”) is necessary and sufficient for the rationalization of the data by a well-behaved utility function. Our...

We study markets with indivisible goods where monetary compensations are not possible. Each individual is endowed with an object and a preference relation over all objects. When preferences are strict, Gale's top trading cycle algorithm finds the unique core allocation. When preferences are not...

A multiple-partners assignment game with heterogeneous sales and multi-unit demands consists of a set of sellers that own a given number of indivisible units of potentially many different goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of...

We study markets with indivisible goods where monetary compensations are not possible. Each individual is endowed with an object and a preference relation over all objects. When preferences are strict, Gale's top trading cycle algorithm finds the unique core allocation. When preferences are not...

The problem of allocating bundles of indivisible objects without transfers arises in the assignment of courses to students, of computing resources like CPU time, memory and disk space to computing tasks and the truck loads of food to food banks. In these settings the complementarities in...

We identify a natural counterpart of the standard GARP for demand data in which goods are all indivisible. We show that the new axiom (DARP, for "discrete axiom of revealed preference") is necessary and sufficient for the rationalization of the data by a well-behaved utility function. Our...