Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Stable matching problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==See also== * [[Matching (graph theory)]] β matching between different vertices of the graph; usually unrelated to preference-ordering. * [[Envy-free matching]] β a relaxation of stable matching for many-to-one matching problems * [[Rainbow matching]] for edge colored graphs * [[Stable matching polytope]] * [[Lattice of stable matchings]] * [[Secretary problem]] (also called '''marriage problem''') β deciding when to stop to obtain the best reward in a sequence of options
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)