The DOI matches its Crossref record.
Thickness and Information in Dynamic Matching Markets
Open accessAbstract
We introduce a simple model of dynamic matching in networked markets, where agents arrive and depart stochastically and the composition of the trade network depends endogenously on the matching algorithm. If the planner can identify agents who are about to depart, then waiting to thicken the market substantially reduces the fraction of unmatched agents. If not, then matching agents greedily is close to optimal. We specify conditions under which local algorithms that choose the right time to match agents, but do not exploit the global network structure, are close to optimal. Finally, we consider a setting where agents have private information about their departure times and design a mechanism to elicit this information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Ridesourcing systems: A framework and review
Wang, H., & Yang, H. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.07.009 · Cited by 538
Diffusion in networks and the virtue of burstiness
Akbarpour, M., & Jackson, M. O. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1722089115 · Cited by 33
Self-citation
Metadata
- Authors
- Akbarpour, M., Li, S., & Gharan, S. O.
- Venue
- Journal of Political Economy
- Publisher
- University of Chicago Press
- Published
- 2020-03
- Volume
- 128
- Issue
- 3
- Pages
- 783-815
- ISSN
- 0022-3808 (ISSN-L)
- 1537-534X
- OpenAlex
- W3122264942
- Cited by
- 171
- References
- 0
- FWCI
- 25.56
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Thickness and Information in Dynamic Matching Markets. https://app.cochat.ai/papers/10.1086/704761
- The paper
- Akbarpour, M., Li, S., & Gharan, S. O. (2020). Thickness and Information in Dynamic Matching Markets. Journal of Political Economy. https://doi.org/10.1086/704761
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.