Stable matchings through fixed points and graphs

zbMATH Open1224.05405MaRDI QIDQ3074446FDOQ3074446

Authors: Tamás Fleiner 

Publication date: 8 February 2011

Recommendations

• A Fixed-Point Approach to Stable Matchings and Some Applications
• On a characterization of stable matchings
• On stable matchings and flows
• What are stable matchings good for? Stable matchings and their applications
• On the set of stable matchings in a bipartite graph

zbMATH Keywords

fixed point theoremsstable matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Cited In (11)

• Characterization of super-stable matchings
• On stable matchings and flows
• A Fixed-Point Approach to Stable Matchings and Some Applications
• Stable schedule matchings
• von Neumann-Morgenstern farsightedly stable sets in two-sided matching
• Many-to-One Stable Matching: Geometry and Fairness
• An algorithm to compute the full set of many-to-many stable matchings.
• Stable and crossing structures
• Perfect matching interdiction problem restricted to a stable vertex
• Of Stable Marriages and Graphs, and Strategy and Polytopes
• Stable matchings in high dimensions via the Poisson-weighted infinite tree

This page was built for publication: Stable matchings through fixed points and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3074446)