This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...

We consider the problem of probabilistically allocating a single indivisible good among agents when monetary transfers are allowed. We construct a new strategy-proof rule, called the second price trading rule, and show that it is second best efficient. Furthermore, we give the second price...

We study dominant strategy implementation especially in economic environments. We first showthat in general environments, strategy-proofness and quasi-strong-non-bossiness together are necessary and sufficient for dominant strategy implementation via the associated direct revelationmechanism. We...

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 situations where a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. For example, suppose that a government wishes to allocate a fixed number of licenses to operate in its country to private...

We study the slot allocation problem where agents have quasi-linear single-peaked preferences over slots and identify the rules satisfying efficiency, strategy-proofness, and individual rationality. Since the quasi-linear single-peaked domain is not connected, the famous characterization of the...

We search for impartiality in the allocation of objects when monetary transfers are not possible. Our main focus is anonymity. The standard definition requires that if agents' names are permuted, their assignments should be permuted in the same way. Since no rule satisfies this definition in...

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by Sönmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In particular,...

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that efficient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...

We consider the problem of probabilistically allocating a single indivisible good among agents when monetary transfers are allowed. We construct a new strategy-proof rule, called the second price trading rule, and show that it is second best efficient. Furthermore, we give the second price...