This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjostrom, and Yamato, 2006; Saijo, Sjostrom, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal richness. 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 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...

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

This study considers Nash implementation in the problem of selecting an alternative when an agent has single-peaked preferences. We investigate condition μ (Moore and Repullo, 1990) and condition μ2 (Moore and Repullo, 1990; Dutta and Sen, 1991), which are necessary and sufficient conditions for...

We consider full-truthfulNash implementation, which requires that truth telling by each agent should be a Nash equilibrium of a direct revelation mechanism, and that the set of Nash equilibriumoutcomes of the mechanismshould coincide with the f-optimal outcome. We showthat restricted...