468,243 Members | 2,038 Online
Bytes | Developer Community
New Post

Home Posts Topics Members FAQ

Post your question to a community of 468,243 developers. It's quick & easy.

Estimating the highest value in a set one element at a time

Motoma
3,237 Expert 2GB
Hi folks,

I'm having trouble remembering the name of an algorithm I now am trying to reproduce.

The basics of the problem are as such:
  1. Given a finite set of a known length
  2. Look at the first item in the set.
  3. Choose whether to accept that value, or look at the next one
  4. Optimize for the best result, never being able to revisit prior values

So for instance, given a set of numbers [8,23,5,192,3,56,9,11,34,85,23,50,31,5], you are only able to "see" the first element in the list (8). It then needs to decide if that number is sufficient (let's assume we're optimizing for the max value) or if it should continue the search. If it accepts the value, the algorithm is finished, if it continues, it looks at 23, and makes the same assessment. This continues until a value is accepted or the list is complete, with the goal to have the algorithm score higher than random sampling.

Does anyone have the name for this problem, or better yet a wikipedia page for an algorithm to solve this problem?

Thanks in advance,
Motoma
Jul 21 '20 #1

✓ answered by Banfa

I think you are talking about the Secretary Problem https://en.wikipedia.org/wiki/Secretary_problem

2 1668
Banfa
9,033 Expert Mod 8TB
I think you are talking about the Secretary Problem https://en.wikipedia.org/wiki/Secretary_problem
Jul 21 '20 #2
Motoma
3,237 Expert 2GB
That's exactly what I was looking for, Banfa, thank you so much!
Jul 22 '20 #3

Post your reply

Sign in to post your reply or Sign up for a free account.

Similar topics

6 posts views Thread by Ada | last post: by
3 posts views Thread by =?Utf-8?B?cm9kY2hhcg==?= | last post: by
reply views Thread by NPC403 | last post: by
reply views Thread by kermitthefrogpy | last post: by
By using this site, you agree to our Privacy Policy and Terms of Use.