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

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

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

This paper presents a tractable dynamic general equilibrium model that can explain cross-country empirical regularities in geographical mobility, unemployment and labor market institutions. Rational agents vote over unemployment insurance (UI), taking the dynamic distortionary effects of...

Extensive field and experimental evidence in a variety of environments show that behavior depends on a reference point. This paper provides an axiomatic characterization of this dependence. We proceed by imposing gradually more structure on both choice correspondences and preference relations,...

We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists...

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single-peaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended...

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