This paper introduces a new algorithm for pair matching. The method is called SBAM (Sparse Biproportionate Adjustment Matching) and can be characterized as either cross-entropy minimizing or matrix balancing. The method is demonstrated in the context of a new Danish microsimulation model.