Asylum seekers are often assigned to localities upon arrival using uninformed matching systems, which lead to inefficient and unfair allocations. This paper proposes an informed dynamic mechanism as an intuitive and easy-to-implement alternative. Our mechanism can be adopted in any dynamic refugee matching problem given locality-specific quotas and that asylum seekers map into specific categories. Any matching selected by the proposed mechanism is Pareto efficient, and envy between localities is bounded by a single asylum seeker. Our simulations show that the proposed mechanism outperforms uninformed mechanisms even in presence of severe misclassification error in the estimation of asylum seeker categories.