The rate of convergence to perfect competition of matching and bargaining mechanisms
Artyom Shneyerov () and
Chi Leung Wong
Journal of Economic Theory, 2010, vol. 145, issue 3, 1164-1187
We study the steady state of a market with incoming cohorts of buyers and sellers who are matched pairwise and bargain under private information. A friction parameter is [tau], the length of the time period until the next meeting. We provide a necessary and sufficient condition for the convergence of mechanism outcomes to perfect competition at the linear rate in [tau], which is shown to be the fastest possible among all bargaining mechanisms. The condition requires that buyers and sellers always retain some bargaining power. The bargaining mechanisms that satisfy this condition are called nonvanishing bargaining power (NBP) mechanisms. Simple random proposer take-it-or-leave-it protocols are NBP, while k-double auctions (k-DA) are not. We find that k-DAs have equilibria that converge to perfect competition at a linear rate, converge at a slower rate or even do not converge at all.
Keywords: Matching; and; bargaining; Search; Double; auctions; Foundations; for; perfect; competition; Rate; of; convergence (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
Working Paper: The Rate of Convergence to Perfect Competition of Matching and Bargaining Mechanisms (2008)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:145:y:2010:i:3:p:1164-1187
Access Statistics for this article
Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell
More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Haili He ().