  We examine the robustness of bottleneck assignment problems to perturbations
in the assignment weights. We derive two algorithms that provide uncertainty
bounds for robust assignment. We prove that the bottleneck assignment is
guaranteed to be invariant to perturbations which lie within the provided
bounds. We apply the method to an example of task assignment for a multi-agent
system.
