This paper develops a class of equilibrium-independent predictions of competitive equilibrium with indivisibilities. Specifically, we prove an analogue of the “Lone Wolf Theorem” of classical matching theory, showing that when utility is perfectly transferable, any agent who does not...

Combinatorial allocation involves assigning bundles of items to agents when the use of money is not allowed. Course allocation is one common application of combinatorial allocation, in which the bundles are schedules of courses and the assignees are students. Existing mechanisms used in practice...

In general screening problems, implementable allocation rules correspond exactly to Walrasian equilibria of an economy in which types are consumers with quasilinear utility and unit demand. Due to the welfare theorems, an allocation rule is implementable if and only if it induces an efficient...