Managing congestion in decentralized matching markets

Nick Arnosti, Ramesh Johari, Yash Kanoria

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Scopus citations

Abstract

We consider a decentralized two-sided matching market in which agents arrive and depart asynchronously. As a result, it is possible that an agent on one side of the market (a "buyer") identifies an agent on the other side of the market (a "seller") who is a suitable match, only to find that the seller is already matched. We find using a mean field approach that lack of knowledge about availability can create large welfare losses to both buyers and sellers. We consider a simple intervention available to the platform: limiting visibility of sellers. We find that this intervention can significantly improve the welfare of agents on both sides of the market; sellers pay lower application costs, while buyers are less likely to find that the sellers they screen have already matched. Somewhat counterintuitively, the benefits of showing fewer sellers to each buyer are greatest in markets in which there is a shortage of sellers.

Original languageEnglish (US)
Title of host publicationEC 2014 - Proceedings of the 15th ACM Conference on Economics and Computation
PublisherAssociation for Computing Machinery
Pages451
Number of pages1
ISBN (Print)9781450325653
DOIs
StatePublished - 2014
Externally publishedYes
Event15th ACM Conference on Economics and Computation, EC 2014 - Palo Alto, CA, United States
Duration: Jun 8 2014Jun 12 2014

Publication series

NameEC 2014 - Proceedings of the 15th ACM Conference on Economics and Computation

Other

Other15th ACM Conference on Economics and Computation, EC 2014
Country/TerritoryUnited States
CityPalo Alto, CA
Period6/8/146/12/14

Keywords

  • decentralized
  • market design
  • matching
  • mean field

Fingerprint

Dive into the research topics of 'Managing congestion in decentralized matching markets'. Together they form a unique fingerprint.

Cite this