On a lemma of Scarf.

DOI10.1016/S0095-8956(02)00028-XzbMath1058.05031MaRDI QIDQ1403911

Ron Aharoni, Tamás Fleiner

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

hypergraphspartial ordersfractional kernels in a digraphGale-Shapley theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)

Related Items

Matching couples with Scarf's algorithm, On the complexity of stable hypergraph matching, stable multicommodity flow and related problems, Analysis of stochastic matching markets, Review of the theory of stable matchings and contract systems, Stable and meta-stable contract networks, The Stable Roommates Problem with Choice Functions, Perfect graphs, kernels, and cores of cooperative games, The integral stable allocation problem on graphs, The stable roommates problem with choice functions, An algorithm for a super-stable roommates problem, Stable fractional matchings, Fractional solutions for capacitated NTU-games, with applications to stable matchings, The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems, On the complexity of stable fractional hypergraph matching, A proof of the Erdös-Sands-Sauer-Woodrow conjecture, Random matching under priorities: stability and no envy concepts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroids and Sperner's lemma
• On monochromatic paths in edge-coloured digraphs
• Fractional kernels in digraphs
• A necessary and sufficient condition for the existence of a complete stable matching
• An efficient algorithm for the “stable roommates” problem
• Integer Programming: Methods, Uses, Computations
• The Core of an N Person Game
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage