2022/08/08 by Niclas Boehmer, Klaus Heeger, Boehmer, Niclas +3 · 1 citation
Computer Science · Economics, Econometrics and Finance · #Artificial Intelligence (cs.AI) #Bayesian Modeling and Causal Inference #Computer Science and Game Theory (cs.GT) #Data Mining Algorithms and Applications #FOS: Computer and information sciences #Game Theory and Voting Systems
paper · pdf · doi:10.48550/arxiv.2208.04041
openalex publication_date 2022/08/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Focusing on Stable Roommates (SR) instances, we contribute to the toolbox for conducting experiments for stable matching problems. We introduce a polynomial-time computable pseudometric to measure the similarity of SR instances, analyze its properties, and use it to create a map of SR instances. This map visualizes 460 synthetic SR instances (each sampled from one of ten different statistical cultures) as follows: Each instance is a point in the plane, and two points are close on the map if the corresponding SR instances are similar to each other. Subsequently, we conduct several exemplary experiments and depict their results on the map, illustrating the map's usefulness as a non-aggregate visualization tool, the diversity of our generated dataset, and the need to use instances sampled from different statistical cultures. Lastly, to demonstrate that our framework can also be used for other matching problems under preference, we create and analyze a map of Stable Marriage instances.