Matching on bipartite graphs

Hans Gersbach; Hans Haller

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.

MoreLess

Year of publication:	2015 ; This Version: September 2015
Authors:	Gersbach, Hans ; Haller, Hans
Publisher:	München : CESifo
Subject:	matching theory \| networks \| graphs \| Graphentheorie \| Graph theory \| Matching \| Unternehmensnetzwerk \| Business network \| Deskriptive Statistik \| Descriptive statistics \| Soziales Netzwerk \| Social network \| Netzwerk \| Network