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

Suppose that we have a two player game in which we want to test experimentally whether the subjects learn to play the game theoretic solution. For this purpose we need a matching scheme which assures that a rational subject behaves in each round of the experiment as if he played a separate stage...