Kernels, stable matchings, and Scarf's lemma

zbMATH Open1217.05098MaRDI QIDQ2999655FDOQ2999655

Authors: Tamás Király, Júlia Pap 

Publication date: 16 May 2011

Recommendations

• On a lemma of Scarf.
• scientific article; zbMATH DE number 2086921
• A note on kernels and Sperner's Lemma
• Scarf oiks
• Fractional solutions for capacitated NTU-games, with applications to stable matchings

Mathematics Subject Classification ID

Perfect graphs (05C17) Matching models (91B68)

Cited In (11)

• A note on kernels and Sperner's Lemma
• Stable and crossing structures
• On a lemma of Scarf.
• Kernels in weighted digraphs
• \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
• Fractional solutions for capacitated NTU-games, with applications to stable matchings
• Title not available (Why is that?)
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time
• Scarf oiks
• Review of the theory of stable matchings and contract systems
• \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma

This page was built for publication: Kernels, stable matchings, and Scarf's lemma

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