The Rate of Convergence to Perfect Competition of a Simple Matching and Bargaining Mechanism
AbstractWe 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 InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Microeconomics.ca Website in its series Micro Theory Working Papers with number shneyerov-07-05-01-03-43-25.
Length: 31 pages
Date of creation: 01 May 2007
Date of revision: 01 May 2007
Contact details of provider:
Matching and Bargaining; Search; Double Auctions; Foundations for Perfect Competition; Rate of Convergence;
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:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael Peters).
If references are entirely missing, you can add them using this form.