Manipulation via Endowments in Exchange Markets with Indivisible Goods

We consider exchange markets with heterogeneous indivisible goods. We are interested in exchange rules that are efficient and immune to manipulations via endowments (either with respect to hiding or destroying part of the endowment or transferring part of the endowment to another trader). We consider three manipulability axioms: hiding-proofness, destruction-proofness, and transfer-proofness. We prove that no rule satisfying efficiency and hiding-proofness (which implies individual rationality) exists. For two-agent exchange markets with separable and responsive preferences, we show that efficient, individually rational, and destruction-proof rules exist. However, for separable preferences, no rule satisfies efficiency, individual rationality, and destruction-proofness. In the case of transfer-proofness the compatibility with efficiency and individual rationality for the two-agent case extends to the unrestricted domain. For exchange markets with separable preferences and more than two agents no rule satisfies efficiency, individual rationality, and transfer-proofness.Hiding-proofness, destruction-proofness, transfer-proofness, exchange markets with heterogeneous indivisible objects.

Resource-Monotonicity for House Allocation Problems

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 and resource-monotonicity. The characterized rules assign the objects in a sequence of steps such that at each step there is either a dictator or two agents "trade" objects from their hierarchically specified "endowments."indivisible objects, resource-monotonicity.

Resource-monotonicity for house allocation problems

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 and resource-monotonicity. The characterized rules assign the objects in a sequence of steps such that at each step there is either a dictator or two agents "trade" objects from their hierarchically specified "endowments.