Symmetric Mechanisms for Matching Problems with Two Sides

The core message of this paper is to introduce a general notion of fairness for matching mechanisms, called symmetry, which encompasses different levels of fairness within and across the two sets of agents. The authors prove several possibility and impossibility results involving symmetry, stability, and resoluteness of matching mechanisms.