We study the steady-state of a market with inflowing cohorts of buyers and sellers who are randomly matched pairwise and bargain under private information. Two bargaining protocols are considered: take-it-or-leave-it offering and the double auction. There are frictions due to costly search and time discounting, parameterized by a single number t > 0 proportional to the waiting time until the next meeting. We study the efficiency of these mechanisms as the frictions are removed, i.e. t 0. We find that all equilibria of the take-it-or-leave-it offering mechanism converge to the Walrasian limit, at the fastest possible rate O(t) among all bargaining mechanisms. For the double auction mechanism, we find that there are equilibria that converge at the linear rate, those that converge at a slower rate or even not converge at all.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Microeconomics.ca Website in its series Micro Theory Working Papers with number
shneyerov-07-05-01-03-43-25.
Find related papers by JEL classification: C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)