Abstract
In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm.
Similar content being viewed by others
References
Powell, W.B. (1989). “A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy.” Transportation Science 23(4), 231–243.
Shapley, L.S. (1962). “Complements and Substitutes in the Optimal Assignment Problem.” Naval Research Logistics Quarterly 9, 45–48.
Spivey, M.Z. and W.B. Powell. “The Dynamic Assignment Problem.” Transportation Science. (To appear).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Spivey, M.Z., Powell, W.B. Some Fixed-Point Results for the Dynamic Assignment Problem. Annals of Operations Research 124, 15–33 (2003). https://doi.org/10.1023/B:ANOR.0000004760.20323.fc
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000004760.20323.fc