Allocating appointment slots is presented as a new application for market design. We consider online booking systems that are commonly used by public authorities to allocate appointments for driver's licenses, visa interviews, passport renewals, etc. We document that black markets for...

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 run an online experiment to study the origins of algorithm aversion. Participants are either in the role of workers or of managers. Workers perform three real-effort tasks: task 1, task 2, and the job task which is a combination of tasks 1 and 2. They choose whether the hiring decision...

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

The paper surveys the experimental literature on matching markets. It covers house allocation, school choice, and two-sided matching markets such as college admissions. The main focus of the survey is on truth-telling and strategic manipulations by the agents, on the stability and efficiency of...

We document experimentally how biased self-assessments affect the outcome of matching markets. In the experiments, we exogenously manipulate the self-confidence of participants regarding their relative performance by employing hard and easy real-effort tasks. We give participants the option to...

We show that Ergin & Sönmez's (2006) results which show that for schools it is a dominant strategy to truthfully rank the students under the Boston mechanism, and that the Nash equilibrium outcomes in undominated strategies of the induced game are stable, rely crucially on two assumptions....

This paper studies a general school choice problem with or without outside options. The Gale-Shapley student-proposing deferred acceptance mechanism (DA) has played a central role not only in theory but also in important practical applications. We show that in problems where some students cannot...

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