I have a problem where I have to pair workers to perform task. This means that each pair p-q can only perform a task t. I have to optimally find for each task t, which pair can best perform the task optimally for assignment.
How can I convert this problem to a matrix that I can solve using the Hungarian algorithm because obviously this cannot be a nxn matrix that is easily solved by the algorithm. Or is there an algorithm that I can use for such a case?