Abstract:

We consider the prosaic system of matching which is specified by the following two common rules: (i) Each woman (man) proposes to at most one man (woman). (ii) A man and a woman marry each other if they propose to each other. Weprove that this system implements the correspondence of stable matchings by strong Nash Equilibria. We also find a simple extensive game form which implements the same correspondence by subgame perfect equilibria.

Website