Does this constraint satisfaction problem have a name
This is a special case of perfect matching in bipartite graphs and could be solved using standard algorithms for that problem  (e.g., the Hungarian algorithm). It is not the perfect matching problem (it looks easier; and it is much more specific), but it is a special case of it.