In which matching markets does the short side enjoy an advantage?
Yash Kanoria, Seungki Min, Pengyu Qian
Abstract
We revisit the popular random matching market model introduced by Knuth (1976) and Pittel (1989), and shown by Ashlagi, Kanoria and Leshno (2013) to exhibit a “stark effect of competition”; in particular, with any difference in the number of agents on the two sides (“imbalance”), the short side agents obtain substantially better outcomes. We generalize the model to allow “partially connected” markets with each agent having an average degree d in a random (undirected) graph. Each agent has a (uniformly random) preference ranking over only their neighbors in the graph. We characterize stable matchings in large markets and find that the short side enjoys a significant advantage only for d exceeding log2 n where n is the number of agents on one side: For moderately connected markets with d = o(log2 n), we find that there is no advantage to being on the short side (for O(n1–∊) market imbalance), with agents on both sides getting a -ranked partner on average. Notably, this “mild competition” regime extends far beyond the connectivity threshold of d = Θ(log n). In contrast, for densely connected markets with d = ω(log2 n), we find a strong effect of competition, namely, short side agents get a log n-ranked partner on average, while the long side agents get a partner of (much larger) rank d/log n on average. Our results and analysis suggest that in general matching markets, being on the short side confers an advantage if and only if the number of short-side agents who remain unmatched is small relative to the market imbalance.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 3deb50af-295b-4b9d-bf7c-b4393e40e1a8Cited by top-tier papers2
- Structural Complexities of Matching MechanismsYannai A. Gonczarowski, Clayton ThomasSTOC 2024 · 4 citations
- Characterization of Priority-Neutral Matching LatticesClayton ThomasFOCS 2025
Related papers
- From Signaling to Interviews in Random Matching MarketsMaxwell Allman, Itai Ashlagi, Amin Saberi, Sophie H. YuSTOC 2025 · 1 citation
- Decentralized, Communication- and Coordination-free Learning in Structured Matching MarketsChinmay Maheshwari, Shankar Sastry, Eric MazumdarNeurIPS 2022 · 22 citations
- Beyond log2(T) regret for decentralized bandits in matching marketsSoumya Basu, Karthik Abinav Sankararaman, Abishek SankararamanICML 2021 · 45 citations
- Improved Analysis for Bandit Learning in Matching MarketsFang Kong, Zilong Wang, Shuai LiNeurIPS 2024 · 8 citations
- Adaptive Bandit Algorithms for Contextual Matching MarketsShiyun Lin, Simon Mauras, Vianney Perchet, Nadav MerlisICML 2026
