# Stable Marriage with Multi-Modal Preferences

arXiv: https://arxiv.org/abs/1801.02693 · HTML: https://mlsanity.com/paper/1801.02693/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Jan 2018.

## Built on by (most cited first, 1 of 1)

- [WeaveNet for Approximating Two-sided Matching Problems](https://mlsanity.com/paper/2310.12515/) (2023)

## Abstract (arXiv)

We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one "evaluation mode" (e.g., more than one criterion); thus, each agent is equipped with multiple preference lists, each ranking the counterparts in a possibly different way. We introduce and study three natural concepts of stability, investigate their mutual relations and focus on computational complexity aspects with respect to computing stable matchings in these new scenarios. Mostly encountering computational hardness (NP-hardness), we can also spot few islands of tractability and make a surprising connection to the textscGraph Isomorphism problem.