Games implementing the stable rule of marriage problems in strong Nash equilibria
In a marriage problem, we introduce a condition called "exclusive matchability (EM)": the condition mainly says that each pair of a man and a woman can choose to be a matching pair regardless of others' actions. This condition is essential to strong Nash implementation of the stable rule. We show that any mechanism which satisfies exclusive matchability implements the stable rule in strong Nash equilibria.