Global games are widely used for equilibrium selection to predict behaviour in complete information games with strategic complementarities. We establish two results on the global game selection. First, we show that it is independent of the payoff functions of the global game embedding, though it...

Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demanding school choice mechanisms. Disclosing information on applications in previous admission periods makes it easier to asses the chances of being admitted at a particular school, and hence may...

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 prove that the global game selection in all 3 x 3 payoff-symmetric supermodular games is independent of the noise structure. As far as we know, all other proofs of noise independence of such games rely on the existence of a so-called monotone potential (MP) maximiser. Our result is more...