Stability is a central concept in matching theory, while nonbossiness is important in many allocation problems. We show that these properties are incompatible: there does not exist a matching mechanism that is both stable and nonbossy.