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

We prove a general possibility result for collective decision problems where individual allocations are one-dimensional, preferences are single-peaked (strictly convex), and feasible allocation profiles cover a closed convex set. Special cases include the celebrated median voter theorem (Black...

We consider the problem of allocating an amount of a perfectly divisible good among a group of n agents. We study how large a preference domain can be to allow for the existence of strategy-proof, symmetric, and efficient allocation rules when the amount of the good is a variable. This question...