Graph matching remains a core challenge in computer vision, where establishing correspondences between features is crucial for tasks such as object recognition, 3D reconstruction and scene ...

This paper studies the falsifiability of two-sided matching theory when agents' preferences are unknown. A collection of matchings is rationalizable if there are preferences for the agents involved so ...