<p>Let's assume the first strategy is the best until someone comes up with a better one, ok?</p>

<p>So we set a threshold for <em>value</em> (between 0 and <em>v</em>). If the value of the candidate is higher than the threshold, try to hire that candidate. Otherwise, interview the next candidate. If we interview several candidates in a row whose value is below the threshold, decrease the threshold until future candidates are likely to have a higher value. If d is low and the candidates decline offers, lower the threshold further. </p>

<p>A few points to determine: the first threshold for <em>value</em>. It's probably ok to wait a few days and just interview candidates so we can see what kind of values they have. Then set a threshold so that 50% (or 20% or 80% or whatever%) of the candidates have higher values. </p>

<p>Another point to determine: when we fail to hire a secretary, how frequently and how much should we lower the threshold.</p>

<p>If <em>v</em> is unknown, we obviously have to observe a few values before making good guesses for a good threshold.</p>

<p>If <em>d</em> is unknown, we'll have to try to hire a few candidates before tuning the algorithm.</p>

<p>What was not mentioned in the question: </p>

<ol>
<li>How long does it take for the candidate to accept or decline the job offer? </li>
<li>Is the game over when the first candidate accepts the offer?</li>
<li>Can you play the game <em>n</em> times?</li>
</ol>

<p>If you can't choose the candidates for the interview it seems like winning this game is a matter of coincidence but I might be wrong.</p>

CC BY-SA 3.0
2014-09-11T17:42:28.407Z
Thanks for your answer, Miro.  To answer your questions:
1. one day
2. yes
3. no
The goal is to get the highest score possible.  Note, if $v$ is very small, then the best solution is to hire the first person who will take the job.  If $v$ is very high (and $d$ "reasonable), then it is beneficial to wait until a good candidate comes along and try to hire them.
bbejot
CC BY-SA 3.0
2014-09-11T17:04:01.003Z
2014-09-11T17:04:01.003Z
Miro Lehtonen
<p>In the standard <a href="https://en.wikipedia.org/wiki/Secretary_problem" rel="nofollow">Secretary Problem</a>, the goal is to hire the best secretary from a list of candidates.  I've recently witnessed a failed hiring attempt for a needed position and it inspired a similar game:</p>

<p>The goal is to maximize the net score.  Each candidate has a value that (if hired) would be added to the score.  And each day that goes by without hiring a candidate costs the company 1 point of score.  Starting score is 0.</p>

<p>Each day, the company either interviews a new candidate or attempts to hire a previously interviewed candidate.  The value of the candidate is discovered during the interview and is uniformly distributed between $0$ and (known) $v$.  There is an unlimited number of possible candidates to interview.</p>

<p>If the job is offered to a candidate, then the candidate will accept with a probability of $d^k$ for (known) constant $d$ and $k$ being the number of days since the candidate was interviewed.  You may only attempt to hire a candidate once.</p>

<p>So the question is: what is the best strategy for this game given $v$ and $d$?  Other natural questions: what is the best strategy if $v$ and/or $d$ are unknown?</p>

<p>Any insights, answers, or references to similar games would be appreciated.</p>

<ds.algorithms><gt.game-theory>
Generalized Secretary Optimization Problem
bbejot
# Generalized Secretary Optimization Problem

(Asked by: username_0 on 2014-09-09)

In the standard [Secretary Problem](https://en.wikipedia.org/wiki/Secretary_problem), the goal is to hire the best secretary from a list of candidates. I've recently witnessed a failed hiring attempt for a needed position and it inspired a similar game:

The goal is to maximize the net score. Each candidate has a value that (if hired) would be added to the score. And each day that goes by without hiring a candidate costs the company 1 point of score. Starting score is 0.

Each day, the company either interviews a new candidate or attempts to hire a previously interviewed candidate. The value of the candidate is discovered during the interview and is uniformly distributed between $0$ and (known) $v$. There is an unlimited number of possible candidates to interview.

If the job is offered to a candidate, then the candidate will accept with a probability of $d^k$ for (known) constant $d$ and $k$ being the number of days since the candidate was interviewed. You may only attempt to hire a candidate once.

So the question is: what is the best strategy for this game given $v$ and $d$? Other natural questions: what is the best strategy if $v$ and/or $d$ are unknown?

Any insights, answers, or references to similar games would be appreciated.

**Tags:** ds.algorithms, gt.game-theory

---

## 1 answers

### Answer by username_1 on 2014-09-11. Score: 2

Let's assume the first strategy is the best until someone comes up with a better one, ok?

So we set a threshold for *value* (between 0 and *v*). If the value of the candidate is higher than the threshold, try to hire that candidate. Otherwise, interview the next candidate. If we interview several candidates in a row whose value is below the threshold, decrease the threshold until future candidates are likely to have a higher value. If d is low and the candidates decline offers, lower the threshold further.

A few points to determine: the first threshold for *value*. It's probably ok to wait a few days and just interview candidates so we can see what kind of values they have. Then set a threshold so that 50% (or 20% or 80% or whatever%) of the candidates have higher values.

Another point to determine: when we fail to hire a secretary, how frequently and how much should we lower the threshold.

If *v* is unknown, we obviously have to observe a few values before making good guesses for a good threshold.

If *d* is unknown, we'll have to try to hire a few candidates before tuning the algorithm.

What was not mentioned in the question:

1. How long does it take for the candidate to accept or decline the job offer?
2. Is the game over when the first candidate accepts the offer?
3. Can you play the game *n* times?

If you can't choose the candidates for the interview it seems like winning this game is a matter of coincidence but I might be wrong.

> **Comments:**
> **username_0**: Thanks for your answer, Miro.  To answer your questions: 1. one day 2. yes 3. no The goal is to get the highest score possible.  Note, if $v$ is very small, then the best solution is to hire the first person who will take the job.  If $v$ is very high (and $d$ "reasonable), then it is beneficial to wait until a good candidate comes along and try to hire them.  

---

