A local interaction dynamic for the matching problem
From MaRDI portal
Publication:2170567
Recommendations
- Local search approaches in stable matching problems
- A Local Computation Approximation Scheme to Maximum Matching
- Local matching dynamics in social networks
- Local matching dynamics in social networks
- Maximum locally stable matchings
- A local algorithm and its percolation analysis of bipartite z-matching problem
- Local interactions and \(p\)-best response set
- Matchings defined by local conditions
Cites work
- A necessary and sufficient condition for the existence of a complete stable matching
- An efficient algorithm for the “stable roommates” problem
- Analysis of ground state in random bipartite matching
- College Admissions and the Stability of Marriage
- Happier world with more information
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- Matching games with partial information
- On a generalization of the stable roommates problem
- On Kuhn's Hungarian Method?A tribute from Hungary
- On the existence of stable roommate matchings
- Random paths to stability in the roommate problem
- Random Paths to Stability in Two-Sided Matching
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
Cited in
(2)
This page was built for publication: A local interaction dynamic for the matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170567)