Reducing Profile-Based Matching to the Maximum Weight Matching Problem

Seongbeom Park

The profile-based matching problem is the problem of finding a matching that optimizes profile from an instance $(G,r,⟨u_1,\dots ,u_r⟩)$, where $G$ is a bipartite…