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 multi-unit Vickrey auction with and without advice to subjects on strategy-proofness. The rate of truth-telling among the subjects without advice stays at 20%, whereas the rate increases to 47% among those who have 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...

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

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

We conduct laboratory experiments for the multi-unit Vickrey auction with and without providing advice to subjects on strategy-proofness. Although the rate of truth-telling among the subjects stays at 20% without advice, the rate increases to 47% with advice. By conducting similar experiments...

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