Scarf's algorithm on arborescence hypergraphs
From MaRDI portal
Cites work
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
- A network simplex method
- Characterization of stable matchings as extreme points of a polytope
- College Admissions and the Stability of Marriage
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fractional kernels in digraphs
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- scientific article; zbMATH DE number 5764805 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Incidence matrices and interval graphs
- Matching couples with Scarf's algorithm
- On a lemma of Scarf.
- On the complexity of stable fractional hypergraph matching
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
- Perfect graphs with polynomially computable kernels
- Reducibility among fractional stability problems
- Scarf's algorithm and stable marriages
- Stable matching with proportionality constraints
- Stable Matchings, Optimal Assignments, and Linear Programming
- The Core of an N Person Game
- The geometry of fractional stable matchings and its applications
- The stable admissions polytope
- The Stable Allocation (or Ordinal Transportation) Problem
- Three-Dimensional Stabl Matching Problems
This page was built for publication: Scarf's algorithm on arborescence hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346480)
