We offer complete characterizations of the equilibrium outcomes of two prominent agenda voting institutions that are widely used in the democratic world: the amendment, also known as the Anglo-American procedure, and the successive, or equivalently the Euro-Latin procedure. Our axiomatic...

When the members of a voting body exhibit single peaked preferences, majority winners exist. Moreover, the median(s) of the preferred alternatives of voters is (are) indeed the majority (Condorcet) winner(s). This important result of Duncan Black has been crucial in the development of public...

Rules of k names are frequently used methods to appoint individuals to office. They are two-stage procedures where a first set of agents, the proposers, select k individuals from an initial set of candidates, and then another agent, the chooser, appoints one among those k in the list. In...

I combine a field experiment with a change in voting laws reducing the fine for abstention to assess the effects of monetary incentives to encourage voter participation. Using individual-level experimental variation in the perceived reduction of the fine for abstention and an objective measure...

We provide characterizations of the set of outcomes that can be achieved by agenda manipulation for two prominent sequential voting procedures, the amendment and the successive procedure. Tournaments and super-majority voting with arbitrary quota q are special cases of the general sequential...

We propose a notion of r-rationality, a relative version of satisficing behavior based on the idea that, for any set of available alternatives, individuals choose one of their r-best according to a single preference order. We fully characterize the choice functions satisfying the condition for...

We characterize the set of all individual and group strategy-proof rules on the domain of all single-dipped preferences on a line. For rules defined on this domain, and on several of its subdomains, we explore the implications of these strategy-proofness requirements on the maximum size of the...

A social choice function is group strategy-proof on a domain if no group of agents can manipulate its final outcome to their own benefit by declaring false preferences on that domain. Group strategy-proofness is a very attractive requirement of incentive compatibility. But in many cases it is...

We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of the mand whose ranges...

We consider situations in which agents are not able to completely distinguish between all alternatives. Preferences respect individual objective indifferences if any two alternatives are indifferent whenever an agent cannot distinguish between them. We present necessary and sufficient conditions...