Minimizing the cost of using hiring problems

Question

I read one of the books of the algorithm and found a problem called Hiring Problem. Here is the situation:

I need an interview to hire candidates for my company. I personally cannot interview because I did not. So I hired an employment agency to help hire a candidate. Every day, the agency sends me a candidate from among Russian candidates. The algorithm for this would be:

**Algo Hiring Candidate(n)**  
best=0 // The candidate with the least quality  
for i=1 to n  
If the candidate is better than the best valued candidate we should hire him  
Best=candidate[i]  
return i;  

But here the cost of the interview will always be calculated, since we must interview each candidate. Therefore, we must focus on how to minimize the cost of hiring.

The total cost will be O (interview cost and hiring cost)

I went through a lot of observations, for example, the agency will send a candidate by chance, and in the worst case, we must hire all the candidates, then the cost of hiring will be higher as each candidate arrives in order to improve the quality.

But this is practically impossible, since it is never impossible for all candidates to come always in ascending order. They must come in random order.

I took a lot of comments, but I really can’t minimize the cost of hiring. Can someone help me solve this problem.

Answer 1

I think this is an example . Secretary's task .

Answer 2

() , .

, n , - , ( ). , , , ( " " "" ", ...). , , . n/e n , , n/e" " ( ).

, ​​ . (. 3) - PhD manuscript, , :/p >

, 1., , , , . 2., , . , - , . (cf Preater " , Krieger, Pollak Samuel-Cahn" p- "...).

(- , , , /), , , ( , ), , , .