Stable flows over time
Summary: In this paper, the notion of stability is extended to network flows over time. As a useful device in our proofs, we present an elegant preflow-push variant of the Gale-Shapley algorithm that operates directly on the given network and computes stable flows in pseudo-polynomial time, both in the static flow and the flow over time case. We show periodical properties of stable flows over time on networks with an infinite time horizon. Finally, we discuss the influence of storage at vertices, with different results depending on the priority of the corresponding holdover edges.
- College Admissions and the Stability of Marriage
- Constructing maximal dynamic flows from static flows
- Faster algorithms for stable allocation problems
- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- On stable matchings and flows
- The Stable Allocation (or Ordinal Transportation) Problem
This page was built for publication: Stable flows over time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736580)