Matching in modular lattices

Let L be a finite lattice. A map f of the join irreducible elements of L to the meet irreducible elements of L is called a matching of L if f is one-to-one and x?f(x) for each join irreducible x. We investigate this conjecture: every finite modular lattice has a matching. The conjecture is verified for certain classes of modular lattices.