Optimal matchings of randomly perturbed lattices

Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant perfect matching between this point process and the lattice, such that the matching distance has the same tail behavior as the hole probability of the point process, which is a natural lower bound.