A decision maker may not perfectly maximize her preference over the feasible set. She may feel it is good enough to maximize her preference over a sufficiently large consideration set; or just require that her choice is sufficiently well-ranked (e.g., in the top quintile of options); or even...

The division problem consists of allocating a given amount of an homogeneous and perfectly divisible good among a group of agents with singlepeaked preferences on the set of their potential shares. A rule proposes a vector of shares for each division problem. Most of the literature has...

For division problems with single-peaked preferences, we show that all sequential allotment rules, a large subfamily of strategy-proof and efficient rules, are also obviously strategy-proof. Although obvious strategy-proofness is in general more restrictive than strategy-proofness, this is not...

We study two‐stage collective decision‐making procedures where in the first stage, part of the voters decide what issues will be put in the agenda and in the second stage, the whole set of voters decides on the positions to be adopted regarding the issues that are in the agenda. Using a...

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