This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous, and strategy-proof on a maximal single-crossing domain if and only if it is...

The problem of social choice is studied on a domain with countably many individuals. In contrast to most of the existing literature which establish either non-constructive possibilities or approximate (i.e. invisible) dictators, we show that if one adds a continuity property to the usual set of...

In this paper, we show that in pure exchange economies where the number of goods equals or exceeds the number of agents, any Pareto-efficient and strategy-proof allocation mechanism always allocates the total endowment to some single agent even if the receivers vary.

We study strategy-proof rules for choosing between two alternatives. We consider the full preference domain which allows for indifference. In this framework, for strategy-proof rules, ontoness does not imply efficiency. We weaken the requirement of efficiency to ontoness and characterizes the...

This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous, and strategy-proof on a maximal single-crossing domain if and only if it is...

If only the strict part of social preference is required to be transitive then Independence of Irrelevant Alternatives implies that there is a coalition containing all but one individual that cannot force x to be socially ranked above y for at least half of the pairs of alternatives (x,y)

This paper investigates the number of profiles at which a social choice function is manipulable. It is found that there is a lower bound on this number when the social choice function is assumed non-dictatorial. Also, any number between this lower bound and the maximal number of profiles may be...