The rate of convergence to perfect competition of matching and bargaining mechanisms

Artyom SHNEYEROV, Chi Leung, Adam WONG

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

11 Citations (Scopus)

Abstract

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 τ, 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 τ, 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.
Original languageEnglish
Pages (from-to)1164-1187
Number of pages24
JournalJournal of Economic Theory
Volume145
Issue number3
DOIs
Publication statusPublished - 1 May 2010
Externally publishedYes

Fingerprint

Rate of convergence
Perfect competition
Bargaining power
Buyers
Seller
Cohort
Double auction
Friction
Private information

Keywords

  • Matching and bargaining
  • double auctions
  • foundations for perfect competition
  • rate of convergence
  • search

Cite this

@article{0ccc89a7f9a1418d8b561a41d05cbf0e,
title = "The rate of convergence to perfect competition of matching and bargaining mechanisms",
abstract = "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 τ, 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 τ, 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, double auctions, foundations for perfect competition, rate of convergence, search",
author = "Artyom SHNEYEROV and WONG, {Chi Leung, Adam}",
year = "2010",
month = "5",
day = "1",
doi = "10.1016/j.jet.2010.02.009",
language = "English",
volume = "145",
pages = "1164--1187",
journal = "Journal of Economic Theory",
issn = "0022-0531",
publisher = "Academic Press Inc.",
number = "3",

}

The rate of convergence to perfect competition of matching and bargaining mechanisms. / SHNEYEROV, Artyom; WONG, Chi Leung, Adam.

In: Journal of Economic Theory, Vol. 145, No. 3, 01.05.2010, p. 1164-1187.

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

TY - JOUR

T1 - The rate of convergence to perfect competition of matching and bargaining mechanisms

AU - SHNEYEROV, Artyom

AU - WONG, Chi Leung, Adam

PY - 2010/5/1

Y1 - 2010/5/1

N2 - 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 τ, 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 τ, 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.

AB - 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 τ, 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 τ, 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.

KW - Matching and bargaining

KW - double auctions

KW - foundations for perfect competition

KW - rate of convergence

KW - search

UR - http://commons.ln.edu.hk/sw_master/4493

U2 - 10.1016/j.jet.2010.02.009

DO - 10.1016/j.jet.2010.02.009

M3 - Journal Article (refereed)

VL - 145

SP - 1164

EP - 1187

JO - Journal of Economic Theory

JF - Journal of Economic Theory

SN - 0022-0531

IS - 3

ER -