Please use this identifier to cite or link to this item:
https://hdl.handle.net/10419/45415
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Atakan, Alp E. | en |
dc.date.accessioned | 2010-11-03 | - |
dc.date.accessioned | 2011-05-09T09:34:21Z | - |
dc.date.available | 2011-05-09T09:34:21Z | - |
dc.date.issued | 2010 | - |
dc.identifier.uri | http://hdl.handle.net/10419/45415 | - |
dc.description.abstract | This paper considers a frictional market where buyers and sellers, with unit demand and supply, search for trading opportunities. The analysis focuses on explicit search frictions, allows for two-sided incomplete information, and puts no restriction on agent heterogeneity. In this context, a non-trivial, full trade search equilibrium is shown to exist, equilibria are characterized as the values that satisfy the first order conditions for a non-linear planner's (optimization) problem, and necessary and sufficient conditions are provided for the existence of efficient search equilibria under complete information. These results fully generalize to the twosided incomplete information setting, under an additive separability condition. | en |
dc.language.iso | eng | en |
dc.publisher | |aTÜSİAD-Koç University Economic Research Forum |cIstanbul | en |
dc.relation.ispartofseries | |aWorking Paper |x1030 | en |
dc.subject.jel | C73 | en |
dc.subject.jel | C78 | en |
dc.subject.jel | D83 | en |
dc.subject.ddc | 330 | en |
dc.subject.keyword | Bargaining | en |
dc.subject.keyword | Search | en |
dc.subject.keyword | Matching | en |
dc.subject.keyword | Two-sided Incomplete Information | en |
dc.subject.stw | Matching | en |
dc.subject.stw | Suchtheorie | en |
dc.subject.stw | Unvollkommene Information | en |
dc.subject.stw | Gleichgewicht | en |
dc.title | Efficient dynamic matching with costly search | - |
dc.type | Working Paper | en |
dc.identifier.ppn | 638372461 | en |
dc.rights | http://www.econstor.eu/dspace/Nutzungsbedingungen | en |
Files in This Item:
Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.