Consider a hiring process with candidates coming from different universities. It is easy to order candidates with the same background, yet it can be challenging to compare them otherwise. The latter case requires additional costly assessments, leading to a potentially high total cost for the hiring organization. Given an assigned budget, what would be an optimal strategy to select the most qualified candidate? We model the above problem as a multicolor secretary problem, allowing comparisons between candidates from distinct groups at a fixed cost. Our study explores how the allocated budget enhances the success probability of online selection algorithms.

翻译：考虑一个来自不同大学的求职者招聘流程。对于具有相同背景的求职者易于排序，然而在不同背景间进行比较则可能颇具挑战。后者需要额外的高成本评估，可能导致招聘组织承担高昂的总成本。在给定预算的情况下，如何制定最优策略以选拔最合格的候选人？我们将上述问题建模为一个多颜色秘书问题，允许以固定成本对不同组别的候选人进行比较。本研究探讨了分配预算如何提升在线选择算法的成功概率。