The Structure of Bayesian Stable Matchings

41 Pages Posted: 12 Aug 2024

See all articles by Gaoji Hu

Gaoji Hu

Shanghai University of Finance and Economics - School of Economics

Date Written: July 30, 2024

Abstract

Stability is a central concept in matching theory. We investigate the set of stable matchings in a general environment that can accommodate both complete and incomplete information. We first exemplify how two fundamental structural results, i.e., the celebrated lone wolf theorem and lattice theorem, may fail. Then for each of them, we study the conditions that restore positive results. Our key condition called common information encompasses complete information as a special case, thereby reshaping our understanding of the two structural properties.

Keywords: matching, incomplete information, the lone wolf theorem, the lattice theorem

Suggested Citation

Hu, Gaoji, The Structure of Bayesian Stable Matchings (July 30, 2024). Available at SSRN: https://ssrn.com/abstract=4910284

Gaoji Hu (Contact Author)

Shanghai University of Finance and Economics - School of Economics ( email )

777 Guoding Road
Shanghai, 200433
China

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
75
Abstract Views
248
Rank
631,574
PlumX Metrics