Timing “Versus” Matching: Thickness and Information in Dynamic Markets

on YouTube ↗34m

" summary

Model uses Poisson arrivals (rate m), independent edges with probability p and D = m·p as the expected degree, and agents hit an exponential “critical” clock (rate 1) that forces departure. Main quantitative claim: a patient rule that waits until someone is critical cuts losses exponentially, giving patient loss ≤ e^{-D/2}/2 versus a greedy bound ≥ 1/(2D+1); with D≈8 greedy loses ~8.5% while patient loses ~0.9%. If criticality is unobserved, waiting gives no benefit, so information about urgency is essential.

AI-written summary · about

" chapters (22)

1. 0:00Intro
2. 0:31"Matching" Markets
3. 1:18The Static Question
4. 1:44Dynamic Matching Markets
5. 2:33A New Question
6. 2:58Motivating Example: Kidney Exchange
7. 4:05Value of Waiting: More Information
8. 5:38Questions about Timing
9. 6:14Timing in Kidney Exchange
10. 7:12This Paper: Main Findings
11. 8:51Related Literature (Static) Theory
12. 9:12Outline
13. 14:01Model: Illustration
14. 14:14Model: Two Key Parameters
15. 18:20Goal
16. 20:04Simple Local Matching Algorithms
17. 21:08Comparing Algorithms
18. 23:16Timing vs. Optimization
19. 24:34Greedy vs. Patient vs. OPT
20. 25:41Value of Information
21. 27:08OPT Performance
22. 31:19Last Policy Implication