This paper considers the object allocation problem introduced by Shapley and Scarf (1974). We study secure implementation (Saijo, Sjöström, and Yamato, 2007), that is, double implementation in dominant strategy and Nash equilibria. We prove that (i) an individually rational solution is...

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

In this paper, we show that in pure exchange economies where the number of goods equals or exceeds the number of agents, any Pareto-efficient and strategy-proof allocation mechanism always allocates the total endowment to some single agent even if the receivers vary.

We consider the problem of fairly reallocating the individual endowments of a perfectly divisible good among agents with single-peaked preferences. We provide a new concept of fairness, called position-wise envy-freeness, that is compatible with individual rationality. This new concept requires...

We analyze bankruptcy problems with an indivisible object, where real owners and outside traders want to allocate an indivisible object among them with monetary compensation. The object might be a company that has gone bankrupt or a house left by a parent who has died, and so on. We show that...

In a voting model where the set of feasible alternatives is a subset of a product set $A = A_1\times\cdots\ldots{}A_m$ of $m$ finite categories, we characterize the set of all strategy-proof social choice functions for three different types of preference domains over $A$, namely for the domains...

We consider the problem of allocating heterogeneous objects to agents with money, where the number of agents exceeds that of objects. Each agent can receive at most one object, and some objects may remain unallocated. A bundle is a pair consisting of an object and a payment. An agent's...

We consider the problem of allocating an amount of a perfectly divisible good among a group of n agents. We study how large a preference domain can be to allow for the existence of strategy-proof, symmetric, and efficient allocation rules when the amount of the good is a variable. This question...

A random assignment is robust ex-post Pareto efficient whenever for any of its lottery decomposition, each deterministic assignment in its support is Pareto efficient. We show that ordinal efficiency implies robust ex-post Pareto efficiency while the reverse does not hold. We know that...

We study Nash implementation by natural price-quantity mechanisms in pure exchange economies when agents have intrinsic preferences for responsibility. An agent has an intrinsic preference for responsibility if she cares about truth-telling that is in line with the goal of the mechanism designer...