The following pages link to On a lemma of Scarf. (Q1403911):
Displaying 16 items.
- Matching couples with Scarf's algorithm (Q314433) (← links)
- Analysis of stochastic matching markets (Q378330) (← links)
- An algorithm for a super-stable roommates problem (Q650948) (← links)
- Fractional solutions for capacitated NTU-games, with applications to stable matchings (Q1751188) (← links)
- The integral stable allocation problem on graphs (Q1952506) (← links)
- The stable roommates problem with choice functions (Q1959722) (← links)
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems (Q2167893) (← links)
- Stable fractional matchings (Q2238635) (← links)
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture (Q2312612) (← links)
- Random matching under priorities: stability and no envy concepts (Q2325654) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems (Q2482674) (← links)
- The Stable Roommates Problem with Choice Functions (Q3503861) (← links)
- On the complexity of stable fractional hypergraph matching (Q5091001) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Stable and meta-stable contract networks (Q6051063) (← links)
