Stable Matching Verification: Difference between revisions
Jump to navigation
Jump to search
(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...") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
$n$: number of men and number of women | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 08:23, 10 April 2023
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
$n$: number of men and number of women
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 |