HackerPapers

arXiv:1509.02972cs.GT

On the Multidimensional Stable Marriage Problem

Jared D. Lichtman

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural way and present so called elemental and compound algorithms to generate matchings for a problem instance. We demonstrate the stability of matchings generated by both algorithms, as well as show that the former runs in $O(pn^2)$ time.

arXiv comments
8 pages
Journal reference
DOI
Subjects
cs.GTComputer Science and Game Theory cs.DMDiscrete Mathematics cs.DSData Structures and Algorithms

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Sep 2015 to Sep 2015. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.