We study situations of allocating positions to students based on priorities. An example is the assignment of medical students to hospital residencies on the basis of entrance exams. For markets without couples, e.g., for undergraduate student placement, acyclicity is a necessary and sufficient...

In the context of resource allocation on the basis of priorities, Ergin (2002) identifies a necessary and sufficient condition on the priority structure such that the student-optimal stable mechanism satisfies a consistency principle. Ergin (2002) formulates consistency as a local property based...

An important debate centers on what procedure should be used to allocate students across public schools. We contribute to this debate by developing and estimating a model of school choices by households under one of the most popular procedures known as the Boston mechanism (BM). We recover the...

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 identify in this paper two conditions that characterize the domain of single-peaked preferences on the line in the following sense: a preference profile satisfies these two properties if and only if there exists a linear order L over the set of alternatives such that these preferences are...

We observe that many salient rules to allocate private goods are not only (partially) strategy-proof, but also (partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost sharing, house allocation and auctions, in spite of the...

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

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