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...

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 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 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 problem of fairly allocating an amount of a divisible resource when preferences are single-peaked. We characterize the class of envy-free and peak-only rules and show that the class forms a complete lattice with respect to a dominance relation. We also pin down the...

We conduct laboratory experiments for the Vickrey auction with and without an announcement on strategy-proofness to subjects. Although the rate of truth-telling among the subjects stays at 20% without the announcement, it increases to 47% with the announcement. Moreover, by conducting...

We conducted laboratory experiments for the multi-unit Vickrey auction with and without advice to subjects on strategy-proofness. The rate of truth-telling among the subjects without advice was 20%, whereas the rate increased to 47% among those who received advice. By conducting similar...

This paper studies the problem of fairly allocating an amount of a divisible resource when preferences are single-peaked. We characterize the class of envy-free and peak-only rules and show that the class forms a complete lattice with respect to a dominance relation. We also pin down the...

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...