This study develops an algorithmic framework for incorporating fairness constraints into sequential search problems where inspecting each candidate is costly. The framework generalizes classical ...