We consider collective decision problems where some agents have private information about alternatives and others don't. Voting takes place under strategy-proof rules. Prior to voting, informed agents may or may not disclose their private information, thus eventually influencing the preferences...

Consider the following principle regarding the performance of collective choice rules. "If a rule selects alternative x in situation 1, and alternative y in situation 2, there must be an alternative z, and some member of society whose appreciation of z relative to x has increased when going from...

We observe that three salient solutions to matching, division and house allocation problems are not only (partially) strategy-proof, but (partially) group strategy-proof as well, in appropriate domains of definition. That is the case for the Gale-Shapley mechanism, the uniform rule and the top...

We characterize the maximal sets of preferences under which generalized median voter schemes are strategy-proof. Those domains are defined by a qualified version of single-peakedness, which depends on the distribution of power among agents implied by each generalized median voter scheme

This chapter surveys the literature on strategy proofness from a historical perspective. While I discuss the connections with other works on incentives in mechanism design, the main emphasis is on social choice models.

We model the decision problems faced by the members of societies whose new members are determined by vote. We adopt a number of simplifying assumptions: the founders and the candidates are fixed; the society operates for a fixed number of periods and holds elections at the beginning of each period;...

We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures: the amendment procedure and the successive procedure. We show that a well known result for tournaments, namely that the successive procedure is (weakly) more manipulable than...

We propose three mechanisms to reach a compromise between two opposite parties that must choose one out of a set of candidates and operate under full information. All three mechanisms weakly implement the Unanimity Compromise Set. They all rely on the use of some Rule of k Names, whereby one of...

Pierre Daunou, a contemporary of Borda and Condorcet during the era of the French Revolution and active debates on alternative voting rules, proposed a rule that chooses the strong Condorcet winner if there is one, otherwise eliminates Condorcet losers and uses plurality voting on the remaining...

We study collective decision-making procedures involving the formation of an agenda of issues and the subsequent vote on the position for each issue on the agenda. Issues that are not on the agenda remain unsettled. We use a protocol-free equilibrium concept introduced by Dutta et al. (2004) and...