Matching on Bipartite Graphs
48 Pages Posted: 19 Nov 2015
Date Written: October 27, 2015
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 restrictions on matching. Sabotage of particular matches or location choice can render certain matches infeasible and, therefore, lead to endogenous constraints.
Keywords: matching theory, networks, graphs
JEL Classification: C780, D020, D850
Suggested Citation: Suggested Citation