Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
<|reference_start|>Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments: Focusing on the bipartite Stable Marriage problem, we investigate different robustness measures related to stable matchings. We analyze the computational complexity of computing them and analyze their behavior in extensive experiments on synthetic instances. For instance, we examine whether a stable matching is guaranteed to remain stable if a given number of adversarial swaps in the agent's preferences are performed and the probability of stability when applying swaps uniformly at random. Our results reveal that stable matchings in our synthetic data are highly unrobust to adversarial swaps, whereas the average-case view presents a more nuanced and informative picture.<|reference_end|>
@article{boehmer2024worst-,
    title={Worst- and Average-Case Robustness of Stable Matchings: (Counting)
  Complexity and Experiments},
    author={Kimon Boehmer and Niclas Boehmer},
    journal={arXiv preprint arXiv:2408.09160},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.09160},
    primaryClass={cs.GT}
}