Stable matchings through fixed points and graphs

MaRDI QIDQ3074446zbMATHFDO

Authors Tamás Fleiner

Publication date 8 February 2011

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)

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

Cited in

(12)

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

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)