In a dynamic model of assignment problems, it is shown that small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or payoff under uniform errors, nor for agents with multiple optimal partners under payoff-dependent errors. There can be selection of payoff for agents with a unique optimal partner under payoff-dependent errors. However, when every agent has a unique optimal partner, almost-no-selection is obtained.