Matching on Bipartite Graphs

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
Authors:	Gersbach, Hans
Other Persons:	Haller, Hans (contributor)
Publisher:	[2015]: [S.l.] : SSRN
Subject:	Graphentheorie \| Graph theory \| Matching \| Deskriptive Statistik \| Descriptive statistics

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (48 p)
Series:	CESifo Working Paper Series ; No. 5575
Type of publication:	Book / Working Paper
Language:	English
Notes:	Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments October 27, 2015 erstellt
Other identifiers:	10.2139/ssrn.2693000 [DOI]
Classification:	C78 - Bargaining Theory; Matching Theory ; D02 - Institutions: Design, Formation, and Operations ; D85 - Network Formation
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10013011643