scientific article; zbMATH DE number 5764911
From MaRDI portal
Publication:3579506
Cited in
(11)- Local search approaches in stable matching problems
- Stable marriage with groups of similar agents
- Solving hard stable matching problems involving groups of similar agents
- How should we solve search problems privately?
- A stable marriage requires communication
- Center stable matchings and centers of cover graphs of distributive lattices
- The complexity of approximately counting stable roommate assignments
- The complexity of approximately counting stable matchings
- Finding a Level Ideal of a Poset
- Recognizing when a preference system is close to admitting a master list
- Recognizing when a preference system is close to admitting a master list
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579506)
