Template-Type: ReDIF-Paper 1.0
Title: Steady States in Search-and-Matching Models
Author-Name: Stephan Lauermann
Author-Email: s.lauermann@uni-bonn.de
Author-Name: Georg Noeldeke
Author-Email: georg.noeldeke@unibas.ch
Author-Name: Thomas Troeger
Author-Email: troeger@uni-mannheim.de
Classification-JEL: C78, D83
Keywords: Search, Matching, Steady States

Abstract:  Most of the literature that studies frictional search-and-matching models with 
heterogeneous agents and random search investigates steady states. Steady state requires 
that the flows of agents into and out of the population of unmatched agents balance. Here, 
we investigate the structure of this steady-state condition. We build on the ``fundamental 
matching lemma'' for quadratic search technologies in Shimer and Smith (2000) and establish 
the existence, uniqueness, and comparative-static properties of the solution to the 
steady-state condition for any search technology that satisfies minimal regularity conditions.

Note: 
Length: 28
Creation-Date: 2018-11
Revision-Date: 
File-URL: https://www.crctr224.de/research/discussion-papers/archive/dp055
File-Format: application/pdf
Handle: RePEc:bon:boncrc:CRCTR224_2018_055