IDEAS home Printed from https://ideas.repec.org/p/bon/boncrc/crctr224_2018_055.html
   My bibliography  Save this paper

Steady States in Search-and-Matching Models

Author

Listed:
  • Stephan Lauermann
  • Georg Noeldeke
  • Thomas Troeger

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.

Suggested Citation

  • Stephan Lauermann & Georg Noeldeke & Thomas Troeger, 2018. "Steady States in Search-and-Matching Models," CRC TR 224 Discussion Paper Series crctr224_2018_055, University of Bonn and University of Mannheim, Germany.
    • Handle: RePEc:bon:boncrc:crctr224_2018_055
    as

    Download full text from publisher

    File URL: https://www.crctr224.de/research/discussion-papers/archive/dp055
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stephan Lauermann & Georg Nöldeke & Thomas Tröger, 2020. "The Balance Condition in Search‐and‐Matching Models," Econometrica, Econometric Society, vol. 88(2), pages 595-618, March.

    More about this item

    Keywords

    Search; Matching; Steady States;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bon:boncrc:crctr224_2018_055. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CRC Office (email available below). General contact details of provider: https://www.crctr224.de .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.