How to solve the choosing best secretary Problem for N=100?
The problem is described in detail Here
But what if we limit our N to 100 candidates?
1-If we have 100 Candidates what is the probability that you hire the best one with maximum probability?
2-how to Maximize the expected rank of hired candidate?
3-Compute the probability of success of “MyStrategy”
where MyStrategy is:
Wait till $frac{N+1}{2}$ candidate
Hire anyone with best rank so far
If no such candidate then hire the last candidate?
probability probability-theory
|
show 1 more comment
The problem is described in detail Here
But what if we limit our N to 100 candidates?
1-If we have 100 Candidates what is the probability that you hire the best one with maximum probability?
2-how to Maximize the expected rank of hired candidate?
3-Compute the probability of success of “MyStrategy”
where MyStrategy is:
Wait till $frac{N+1}{2}$ candidate
Hire anyone with best rank so far
If no such candidate then hire the last candidate?
probability probability-theory
see here en.wikipedia.org/wiki/Secretary_problem
– Dr. Sonnhard Graubner
Dec 27 '18 at 12:09
Not following. When you say "hire anyone with best rank so far" you appear to be allowing us to hire from the pool of rejected candidates. That is not allowed under the standard problem, and it would seem to trivialize the issue (as you could just look at all of them and pick the best).
– lulu
Dec 27 '18 at 12:13
If you meant the standard problem, then the standard solution is optimal. The fact that $frac {100}e$ isn't an integer means you have to test the two integers nearest it to see which is better.
– lulu
Dec 27 '18 at 12:14
@lulu I am confused as 100/e is not a probability .
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:22
@lulu i have update the question
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:25
|
show 1 more comment
The problem is described in detail Here
But what if we limit our N to 100 candidates?
1-If we have 100 Candidates what is the probability that you hire the best one with maximum probability?
2-how to Maximize the expected rank of hired candidate?
3-Compute the probability of success of “MyStrategy”
where MyStrategy is:
Wait till $frac{N+1}{2}$ candidate
Hire anyone with best rank so far
If no such candidate then hire the last candidate?
probability probability-theory
The problem is described in detail Here
But what if we limit our N to 100 candidates?
1-If we have 100 Candidates what is the probability that you hire the best one with maximum probability?
2-how to Maximize the expected rank of hired candidate?
3-Compute the probability of success of “MyStrategy”
where MyStrategy is:
Wait till $frac{N+1}{2}$ candidate
Hire anyone with best rank so far
If no such candidate then hire the last candidate?
probability probability-theory
probability probability-theory
edited Dec 27 '18 at 12:25
asked Dec 27 '18 at 12:08
Muhammad Fasiurrehman Sohi
187
187
see here en.wikipedia.org/wiki/Secretary_problem
– Dr. Sonnhard Graubner
Dec 27 '18 at 12:09
Not following. When you say "hire anyone with best rank so far" you appear to be allowing us to hire from the pool of rejected candidates. That is not allowed under the standard problem, and it would seem to trivialize the issue (as you could just look at all of them and pick the best).
– lulu
Dec 27 '18 at 12:13
If you meant the standard problem, then the standard solution is optimal. The fact that $frac {100}e$ isn't an integer means you have to test the two integers nearest it to see which is better.
– lulu
Dec 27 '18 at 12:14
@lulu I am confused as 100/e is not a probability .
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:22
@lulu i have update the question
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:25
|
show 1 more comment
see here en.wikipedia.org/wiki/Secretary_problem
– Dr. Sonnhard Graubner
Dec 27 '18 at 12:09
Not following. When you say "hire anyone with best rank so far" you appear to be allowing us to hire from the pool of rejected candidates. That is not allowed under the standard problem, and it would seem to trivialize the issue (as you could just look at all of them and pick the best).
– lulu
Dec 27 '18 at 12:13
If you meant the standard problem, then the standard solution is optimal. The fact that $frac {100}e$ isn't an integer means you have to test the two integers nearest it to see which is better.
– lulu
Dec 27 '18 at 12:14
@lulu I am confused as 100/e is not a probability .
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:22
@lulu i have update the question
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:25
see here en.wikipedia.org/wiki/Secretary_problem
– Dr. Sonnhard Graubner
Dec 27 '18 at 12:09
see here en.wikipedia.org/wiki/Secretary_problem
– Dr. Sonnhard Graubner
Dec 27 '18 at 12:09
Not following. When you say "hire anyone with best rank so far" you appear to be allowing us to hire from the pool of rejected candidates. That is not allowed under the standard problem, and it would seem to trivialize the issue (as you could just look at all of them and pick the best).
– lulu
Dec 27 '18 at 12:13
Not following. When you say "hire anyone with best rank so far" you appear to be allowing us to hire from the pool of rejected candidates. That is not allowed under the standard problem, and it would seem to trivialize the issue (as you could just look at all of them and pick the best).
– lulu
Dec 27 '18 at 12:13
If you meant the standard problem, then the standard solution is optimal. The fact that $frac {100}e$ isn't an integer means you have to test the two integers nearest it to see which is better.
– lulu
Dec 27 '18 at 12:14
If you meant the standard problem, then the standard solution is optimal. The fact that $frac {100}e$ isn't an integer means you have to test the two integers nearest it to see which is better.
– lulu
Dec 27 '18 at 12:14
@lulu I am confused as 100/e is not a probability .
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:22
@lulu I am confused as 100/e is not a probability .
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:22
@lulu i have update the question
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:25
@lulu i have update the question
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:25
|
show 1 more comment
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3053852%2fhow-to-solve-the-choosing-best-secretary-problem-for-n-100%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3053852%2fhow-to-solve-the-choosing-best-secretary-problem-for-n-100%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
see here en.wikipedia.org/wiki/Secretary_problem
– Dr. Sonnhard Graubner
Dec 27 '18 at 12:09
Not following. When you say "hire anyone with best rank so far" you appear to be allowing us to hire from the pool of rejected candidates. That is not allowed under the standard problem, and it would seem to trivialize the issue (as you could just look at all of them and pick the best).
– lulu
Dec 27 '18 at 12:13
If you meant the standard problem, then the standard solution is optimal. The fact that $frac {100}e$ isn't an integer means you have to test the two integers nearest it to see which is better.
– lulu
Dec 27 '18 at 12:14
@lulu I am confused as 100/e is not a probability .
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:22
@lulu i have update the question
– Muhammad Fasiurrehman Sohi
Dec 27 '18 at 12:25