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 ; Haller, Hans
Publisher:	Munich : Center for Economic Studies and ifo Institute (CESifo)
Subject:	matching theory \| networks \| graphs

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	CESifo Working Paper ; 5575
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	837986737 [GVK] hdl:10419/123215 [Handle] RePec:ces:ceswps:_5575 [RePEc]
Classification:	C78 - Bargaining Theory; Matching Theory ; D02 - Institutions: Design, Formation, and Operations ; D85 - Network Formation
Source:	EconStor

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