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ö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 the problems of fairly allocating indivisible objects and money. The objective of the present study is to examine strategic manipulation under envy-free solutions. We show that each individual obtains the welfare level of his "optimal" envy-free allocation by maximally manipulating...

We extend approval voting so as to elect multiple candidates, who may be either individuals or members of a political party, in rough proportion to their approval in the electorate. We analyze two divisor methods of apportionment, first proposed by Jefferson and Webster, that iteratively...

This paper studies the possibility of secure implementation (Saijo, T., T. Sjöström, and T. Yamato (2007) "Secure Implementation," Theoretical Economics 2, pp. 203-229) in divisible and non-excludable public good economies with quasi-linear utility functions. Although Saijo, Sjöström, and...

Ronald Dworkin's equality of resources, and the closely related concept of envy-freeness, are two of the fundamental ideas behind fair allocation of private goods. The appropriate analog to these concepts in a public decision-making environment is unclear, since all agents consume the same...