Stable Matching Verification (Stable Matching Problem)
Revision as of 10:23, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Matching Verification (Stable Matching Problem)}} == Description == Verify that a given matching is stable, given the preferences == Related Problems == Generalizations: Stable Marriage Problem Related: Almost Stable Marriage Problem, Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Pair Checking == Parameters == No parameters found. == Table of Algorithms == Currently no algorithms in our databas...")
Description
Verify that a given matching is stable, given the preferences
Related Problems
Generalizations: Stable Marriage Problem
Related: Almost Stable Marriage Problem, Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Pair Checking
Parameters
No parameters found.
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions FROM Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| Maximum Inner Product Search | assume: OVH then: for an $\epsilon > {0}$ there is a $c$ such that verifying a stable matching in the boolean $d$-attribute model with $d = c\log n$ dimensions requires time $\Omega(n^{2-\epsilon}). |
2016 | https://arxiv.org/pdf/1510.06452.pdf | link |