Matching to two sides

This paper studies a matching problem in which a group of agents cooperate with agents on two sides. In environments with either nontransferable or transferable utilities, we demonstrate that a stable outcome exists when cooperations exhibit same-side complementarity and cross-side substitutability. Our results apply to pick-side matching problems and membership competition in online duopoly markets.