Pages that link to "Item:Q5704093"
From MaRDI portal
The following pages link to The Stable Allocation (or Ordinal Transportation) Problem (Q5704093):
Displaying 27 items.
- A coloring property for stable allocations (Q274058) (← links)
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- Equitable representation and recruitment (Q537577) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- Stable schedule matching under revealed preference. (Q1414616) (← links)
- The object allocation problem with random priorities (Q1651226) (← links)
- Incentivizing resilience in financial networks (Q1655678) (← links)
- Stable multicommodity flows (Q1736550) (← links)
- Stable flows over time (Q1736580) (← links)
- On stable matchings and flows (Q1736598) (← links)
- Fractional solutions for capacitated NTU-games, with applications to stable matchings (Q1751188) (← links)
- The stable \(b\)-matching polytope revisited (Q1801060) (← links)
- Student admissions and faculty recruitment (Q1885915) (← links)
- The integral stable allocation problem on graphs (Q1952506) (← links)
- Faster algorithms for stable allocation problems (Q1959735) (← links)
- Paths to stable allocations (Q2329415) (← links)
- David Gale in Paris (Q2389279) (← links)
- Stable schedule matchings (Q2454577) (← links)
- Characterizations of the optimal stable allocation mechanism (Q2467483) (← links)
- Stable allocations and partially ordered sets (Q2684044) (← links)
- On Stable Matchings and Flows (Q3057612) (← links)
- Finding a Stable Allocation in Polymatroid Intersection (Q4575653) (← links)
- Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Choice functions on posets (Q6116352) (← links)
- Stable sharing (Q6176743) (← links)
- Popular matchings with weighted voters (Q6494270) (← links)
