This study develops an algorithmic framework for incorporating fairness constraints into sequential search problems where inspecting each candidate is costly. The framework generalizes classical ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results