Pith. sign in

REVIEW 1 cited by

Computational Complexity of Stable Marriage and Stable Roommates and Their Variants

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.08196 v1 pith:5NZGJZDP submitted 2019-04-17 cs.GT

Jiehua Chen This is my paper · ORCID
classification cs.GT
keywords stablecomplexitymarriageproblemsresultsroommatesvariantsalgorithmic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper gives an overview on and summarizes existing complexity and algorithmic results of some variants of the Stable Marriage and the Stable Roommates problems. The last section defines a list of stable matching problems mentioned in the paper. If you find any corrections, suggestions, new or missing results, please send them to jiehua.chen2@gmail.com.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Perspectives on Unsolvability in the Roommates Problem

    cs.GT 2025-05 conditional novelty 6.0 of 10

    Random Stable Roommates instances are typically nearly solvable: they have few odd cycles that block stability, and the stable matchings or partitions they admit are usually few, which makes many NP-hard optimization ...

Pith tools