We theoretically and experimentally study a college admissions problem in which colleges accept students by ranking students' efforts in entrance exams. Students hold private information regarding their ability level that affects the cost of their efforts. We assume that student preferences are...

We report on experiments to replicate Plott and Zeiler's (2005) findings that the WTP-WTA gap disappears when using procedures that are aimed at reducing misunderstandings, such as training rounds for the BDM mechanism. Following the design by Plott and Zeiler (2005) and Isoni, Loomes, and...

We study the allocation of German lawyers to different regional courts for their compulsory legal traineeship. The number of applicants exceeds the number of available positions in a given time period in some regions, so that not all lawyers can be matched simultaneously. As a consequence some...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...

We report an experiment on the Probabilistic Serial (PS) mechanism for allocating indivisible goods. The PS mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship mechanism, has attractive fairness and efficiency properties if people report their preferences...

We consider the problem of allocating several types of indivisible goods when preferences are separable and monetary transfers are not allowed. Our finding is that the coordinatewise application of strategy-proof and non-wasteful rules yields a strategy-proof rule with the following efficiency...

We report an experiment on the Probabilistic Serial (PS) mechanism for allocating indivisible goods. The PS mechanism, a recently discovered alternative to the widely used Random Serial Dictatorship mechanism, has attractive fairness and efficiency properties if people report their preferences...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed. We offer two characterizations of the prominent lottery assignment mechanism called the probabilistic serial. We show that it is the only mechanism satisfying...

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a "newcomer" in the...

Many real-life applications of house allocation problems are dynamic. For example, each year college freshmen move in and seniors move out of on-campus housing. Each student stays on campus for only a few years. A student is a "newcomer" in the beginning and then becomes an "existing tenant"....