An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem

Genç, Begüm; Siala, Mohamed; Simonin, Gilles; O’Sullivan, Barry

doi:10.1007/978-3-030-19212-9_21

Cited by 2 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That is, we sampled 20 instances for each of the following cultures: Impartial Culture, 2-IC with p ∈ {0. 25 Drawing the Map. To draw a map of our dataset, we first compute for each pair of instances from our dataset their mutual attraction distance.…”

Section: Fame-euclideanmentioning

confidence: 99%

A Map of Diverse Synthetic Stable Roommates Instances

Boehmer¹,

Heeger²,

Szufa³

2022

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Fame-euclideanmentioning

confidence: 99%

A Map of Diverse Synthetic Stable Roommates Instances

Boehmer¹,

Heeger²,

Szufa³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…This involves researching ways to measure instability of unequal sets and developing additional or alternative steps in the algorithm optimized for the proposed goal. The paper aims to further enhance the algorithm based on the proposed enhancement and does not aim to provide any mathematical improvements nor compare with other similar problems [23], [24] unless new discoveries can be made.…”

Section: Introductionmentioning

confidence: 99%

Enhancement Of Gale-Shapley algorithm with imbalanced sets for hiring and job finding applications

Mendoza

Barbosa

Cortez

et al. 2022

IJEECS

View full text Add to dashboard Cite

In this paper, <span>we discuss a modification to the Gale Shapley algorithm in this study. We concentrated on how the modified algorithm would operate if the data sets for men and women were not equal. We showed how to measure the average energies of men and women with equal and unequal sets, how the new design of the algorithm will benefit both parties by duplicating sets of data to fill the unequal sets of data, resulting in an equal set of pairings, and how to measure the average energies of men and women of the new algorithm in this paper. Having stated that, each couple will have a stable partner and/or will be queued to the algorithm's suggested stable partner.</span>

show abstract

An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem

Cited by 2 publications

References 10 publications

A Map of Diverse Synthetic Stable Roommates Instances

A Map of Diverse Synthetic Stable Roommates Instances

Enhancement Of Gale-Shapley algorithm with imbalanced sets for hiring and job finding applications

Contact Info

Product

Resources

About