We model centralized school matching as a second stage of a simple Tiebout-model and show that the two most discussed mechanisms, the deferred acceptance and the Boston algorithm, both produce inefficient outcomes and that the Boston mechanism is more efficient than deferred acceptance. This...

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