Priority-Neutral Matchings Lack Key Structural Properties of Stable Matchings

Priority-neutral matchings, a generalization of stable matchings that allows for certain priority violations, lack crucial structural properties enjoyed by stable matchings, such as distributivity and representation via a partial order on rotations.