  In assignment problems, decision makers are often interested in not only the
optimal assignment, but also the sensitivity of the optimal assignment to
perturbations in the assignment weights. Typically, only perturbations to
individual assignment weights are considered. We present a novel extension of
the traditional sensitivity analysis by allowing for simultaneous variations in
all assignment weights. Focusing on the bottleneck assignment problem, we
provide two different methods of quantifying the sensitivity of the optimal
assignment, and present algorithms for each. Numerical examples as well as a
discussion of the complexity for all algorithms are provided.
