  We prove a version of Hall's Harem Theorem where the matching realizes a
function with some special properties of its cycles. Using this approach we
also prove a new computable version of Hall's Harem theorem. We apply it to
non-amenable computable coarse spaces.
