This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...

We consider house (re)allocation problems (Shapley and Scarf, 1974) with strict preferences. We are concerned with the possibility that a pair of agents may gain by swapping their endowments before the operation of the chosen rule. A rule is called endowments-swapping-proof if it is immune to...

We consider house allocation problems (Shapley and Scarf, 1974) with strict preferences. We introduce a new axiom called pre-exchange-proofness, which states that no pair of agents gain by exchanging their endowments with each other prior to the operation of the chosen rule. We establish that a...

We consider the problem of the fair allocation of indivisible goods and money with non-quasi-linear preferences. The purpose of the present study is to examine strategic manipulation under envy-free solutions. We show that under a certain domain-richness condition, each individual obtains the...