We study stable matchings on exogenously given or endogenously formed bipartite graphs that reflect constraints on matching. The effects of a change of the exogenously given graph (constraints) are investigated. Specifically, we examine to what extent individuals gain or lose from relaxing...

This paper investigates stable and efficient networks in the context of risk sharing, when it is costly to establish and maintain relationships that facilitate risk sharing. We find a novel trade-off between efficiency and equality: The most stable efficient networks also generate the most...