Are there algorithms / theorems to find an acyclic matching on the Hasse diagram of a poset.

I am particularly interested in the face poset of a regular CW complex. Also, how to decide if the given acyclic matching is perfect (impossible to add one more vertex). Is there some structure on the set of all acyclic matchings ?