Distributed Algorithm For Solving The Bottleneck Assignment Problem

Assignment problems are found in multiagent systems, where there is a need to allocate multiple tasks to agents. The bottleneck assignment problem (BAP) is an assignment problem where the objective is to minimise the worst individual cost in the assignment. Distributed algorithms for assignments with other objectives have been proposed, yet to date no distributed algorithm for the BAP exists. This paper addresses this gap; we develop a novel distributed algorithm that solves the BAP optimally. The algorithm does not require a centralised decision -maker having access to all information from each agent, which is an advantage over existing algorithms for solving the BAP. We use numerical simulations to compare the optimality of the proposed algorithm against a greedy assignment -finding algorithm.