We study strategy-proof rules for choosing between two alternatives. We consider the full preference domain which allows for indifference. In this framework, for strategyproof rules, ontoness does not imply efficiency. We weaken the requirement of efficiency to ontoness and characterizes the class of strategy-proof rules. We argue that the notion of efficiency is not desirable always. Our main result provides a simple characterization of the class of onto, anonymous and strategy-proof rules in this framework. Our analysis can help policy makers choose among these rules.

No abstract

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. (2003) on dictatorial domains. This is done in two ways. In the first, the notion of connections between pairs of alternatives in Aswal et al. (2003) is weakened to weak connectedness. This notion requires the specification of four preference orderings for every alternative pair. Domains that are linked in the sense of Aswal et al. (2003) with weak connectedness replacing connectedness, are shown to be dictatorial. In the second, the notion of connections for alternative pairs is strengthened relative to its counterpart in Aswal et al. (2003). However, a domain is shown to be dictatorial if the induced graph is merely connected rather than linked. This result generalizes the result in Sato (2010) on circular domains. Terms of use: Documents in EconStor may

We consider locally incentive compatible mechanisms with deterministic allocation rules and transfers with quasilinear utility. We identify a rich class of type spaces, which includes the single peaked type space, where local incentive compatibility does not imply incentive compatibility. Our main result shows that in such type spaces, a mechanism is locally incentive compatible and payment-only incentive compatible if and only if it is incentive compatible. Payment-only incentive compatibility requires that a mechanism that generates the same allocation at two types must have the same payment at those two types. Our result works on a class of ordinal type spaces, which are generated by considering a set of ordinal preferences over alternatives and then considering all non-negative type vectors representing such preferences.JEL Codes: D82, D44, D47

We study strategy-proof rules for choosing between two alternatives. We consider the full preference domain which allows for indifference. In this framework, for strategyproof rules, ontoness does not imply efficiency. We weaken the requirement of efficiency to ontoness and characterizes the class of strategy-proof rules. We argue that the notion of efficiency is not desirable always. Our main result provides a simple characterization of the class of onto, anonymous and strategy-proof rules in this framework. Our analysis can help policy makers choose among these rules.