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

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

Following Barberà, Sonnenschein, and Zhou (1991, Econometrica 59, 595-609), we study rules (or social choice functions) through which agents select a subset from a set of objects. We investigate domains on which there exist nontrivial strategy-proof rules. We establish that the set of separable...

We consider the election model in which voters choose a subset from the set of candidates. Both voters and candidates are assumed to possess preferences with separable strict orderings. We investigate a rule satisfying candidate stability, which is the requirement to deter any candidate from...

Following “Barberà et al. (<CitationRef CitationID="CR1">1991</CitationRef>, Econometrica 59:595–609)”, we study rules (or social choice functions) through which agents select a subset from a set of objects. We investigate domains on which there exist nontrivial strategy-proof rules. We establish that the set of separable...</citationref>

We study a problem in which a group of voters must decide which candidates are elected from a set of alternatives. The voters’ preferences on the combinations of elected candidates are represented by linear orderings. We propose a family of restrictions of the domain of separable preferences....