News for hackers. Stuff that matters.

A comment on Secretary Problem. Parent comment

Re:Secretary Problem by jonlucc on Tuesday March 04, 2014 @08:25AM (#7339989)
According to the article, with such a small n, the contestant should visit ~1.47 of collectors before picking the best one. That's hard to do in practice.
[ Parent | on HN ]
Re:Secretary Problem by sesqu on Tuesday March 04, 2014 @01:10PM (#7341896)
According to the article, with such a small n, the contestant should reject the first collector and pick the best offer from the other three.
[ Parent | on HN ]
Re:Secretary Problem by jamesiain on Wednesday March 05, 2014 @12:17PM (#7348194)
More precisely; reject the first offer but note the price, accept any offer that beats the first one, or accept the final offer if none beat the first.
[ Parent | on HN ]