Some Fixed-Point Results for the Dynamic Assignment Problem
Annals of Operations Research
Mathematics and Computer Science
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.
Spivey, Michael Z, and Warren B. Powell. "Some Fixed-Point Results for the Dynamic Assignment Problem." Annals of Operations Research. 124 (n.d.): 15-33. Print.