We study preferences over procedures in the presence of naive agents. We employ a school choice setting following Pathak and Sönmez (2008) who show that sophisticated agents are better off under the Boston mechanism than under a strategy-proof mechanism if some agents are sincere. We use lab...

We investigate fairness preferences in matching mechanisms using a spectator design. Participants choose between the Boston mechanism or the serial dictatorship mechanism (SD) played by others. In our setup, the Boston mechanism generates justified envy, while the strategy-proof SD ensures...

We investigate fairness preferences in matching mechanisms using a spectator design. Participants choose between the Boston mechanism or the serial dictatorship mechanism (SD) played by others. In our setup, the Boston mechanism generates justified envy, while the strategy-proof SD ensures...

We take school admission mechanisms to the lab to test whether the widely-used manipulable Boston-mechanism disadvantages students of lower cognitive ability and whether this leads to ability segregation across schools. Results show this is the case: lower ability participants receive lower...

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

In a centralized marketplace that was designed to be simple, we identify participants whose choices are dominated. Using administrative data from Hungary, we show that college applicants make obvious mistakes: they forgo the free opportunity to receive a tuition waiver worth thousands of...