Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations
summary
Shows that under a latent utility model (public score plus iid private shock with bounded hazard rate and limited tier range) a modified deferred‑acceptance protocol finds a true stable matching with high probability while cutting communication from linear to about square-root per agent. Method uses oracle queries, firm qualification requirements (broadcast thresholds), initial preference invitations into poly-logarithmic bins, and a two-round simultaneous signaling version that removes sequential proposals and produces low‑communication, w.h.p. stable outcomes.
AI-written summary · about
chapters (10)
- 0:00Introduction and context
- 2:11Market congestion challenges
- 3:58Research goals and approach
- 5:13Model and assumptions
- 8:29The proposed protocol
- 10:17Preference structures
- 13:12Efficient matching protocol
- 17:51Tiered preferences model
- 22:38Protocol insights and summary
- 25:38Q&A and practical challenges
related talks
44mClearing Matching Markets Efficiently: Informative signals and Match Recommendations
50mDiversity in Matching Markets
44mFacilitating the Search for Partners on Matching Platforms
56mMarket Design and Computer-Assisted Markets: An Economist's Perspective
36mThe Intractability of Hylland-Zeckhauser and its Aftermath
52mDashboard Mechanisms for Online Marketplaces
44mOnline Advertisements and Online Algorithms
44mAdverse Selection and Auction Design for Internet Display Advertising