We give an account on what is known on the subject of permutation matchings,
which are bijections of a finite regular semigroup that map each element to one
of its inverses. This includes partial solutions to some open questions,
including a related novel combinatorial problem