All content of this blog is governed by Dutch law and the next policies. Please continue to read this disclaimer by scrolling down.
All content published in this blog is intellectual property of the author of this blog,Jos Berkemeijer, and should, unless explicitly otherwise stated by the author, not be reproduced or copied without permission and/or without giving credit.
Contents/Images/information sourced from external sources are given due credit wherever possible/necessary.
If you have any copyright related issues with any of the contents in this blog please address a mail with all necessary evidence as applicable. Such concerns will be addressed with all due considerations at the earliest by the author.
Names, logos, pictures and other proprietary information quoted in this blog are property of respective companies/owners and are mentioned here for reference purpose only.
Opinions and/or viewpoints expressed in this blog are entirely personal to the author. His employer, relatives, family and friends have nothing to do with these contents and are not liable for anything what so ever.
Every precaution is taken to protect third party identity. If you name/photo has appeared in this blog and you wish to get it removed, please request the author by mail.
While every caution has been taken to provide my readers with most accurate information and honest analysis, please use your discretion before taking any decisions based on the information in this blog. The author will not compensate you in any way whatsoever if you ever happen to suffer a loss/inconvenience/damage because of/while making use of information in this blog.
The author may keep updating old posts on a regular basis and is not bound to explicitly state all corrections made. Regular visitors/email subscribers are likely to miss these updates and they are advised to keep an eye on the gadget below.
The author may not accept or respond to invitations/requests of certain type which he deems inappropriate.
This Blog is hosted on Blogger.The author can not be hold responsible for any server issues or discontinuities, loss or damaging of (hosted) data.
Nofollow tag. All links given to commercial websites will - as much as possible - carry a so called rel=”nofollow” tag, so that search machines may interpret those links as non-sponsored posts. Please be informed that the author is not involved in any kind of sponsored posting on this blog. Articles/links refering to commercial websites are given because the author finds them relevant,interesting or useful to the readers.
Links given to personal pages and blogs do not carry the 'nofollow tag', except in exceptional cases.
Whether you're an actuary, investment manager, HR-manager of respected consumer, in real life you often have to take a decision in a situation where you have to pick out "the best" opportunity out of "n" possibilities. Mostly in a situation where you (ex ante) are only limited aware about what you can expect in terms of quality or quantity.
Some examples:
Making the right investment
You want to make an investment today. Every day your stockbroker offers you about 20 investment opportunities. Your budget allows you to make only one investment today and it should be the best one. How can you be sure to pick the right one?
You have only limited time (say about 10 minutes) for each investment to decide; after that, you'll have to wait for the next offer.
Selecting the best candidate for the job You’re the HR-manager of a certain company. Your external HRM-advisor promised you to present 10 potential candidates for a certain vacancy. After each candidate you have to decide wetter you accept him/her or wetter you go one for a possible better candidate. You want the best candidate. What can you do?
Applying for the best job
You solicited for a new job. Six companies have invited you for a visit. After each visit you are obliged to say wetter you take the job or not. You want the best job. What is wise to do?
Buying a new car
You want to buy a new car. Although the price of that car is fixed, every dealer gives a quick-decision discount.
You decide to visit 7 dealers. After each visit you have to decide wetter you "buy" or "let go" (the dealer will not accept that you come back later after you came to the conclusion that he was after all the best deal).
You want the highest discount you can get; How can you manage?
Optimal Strategy?
In each of these cases you can ask yourself: what is the optimal strategy? Take the first opportunity or wait until the last? Skipping some opportunities or take the median opportunity?
In decision theory literature these kind of problems are known as "Best Choice Problems" (BCP's). More specific the above decision problems are often described as "The Sultan's Dowry Problem" or "The Secretary Problem".
This type of deceision problem is characterised by the following assumptions:
You want "the best" choice out of "n" possibilities
You handle each opportunity after another. After each opportunity you have to decide whether you take the offer or go further (you can’t come back on your decision later).
You only have limited knowledge about the group of "n" possibilities (in terms of quality or quantity)
Solution
The best strategy in these kind of cases is to wait (don’t choose) until the first "m" possibilities of the total number of opportunities "n" have passed. After these "m" possibilities you accept the first offer that is "better" than the one you've had until the moment of decision. The word "better" stands for "better candidate", "better financial offer", etc.
If you’re interested in the mathematical theory behind this kind of problems, click on one of the links below:
As you perhaps noticed in using The Best Choice Calculator, there is a close relation between the number of possibilities [n] and the number of opportunities you had to skip [m].
When we have to take decisions in "real life", we do not (yet) have a build-in computer-chip in our head to calculate for each [n] the corresponding value [m]. In this case all you have to do is to memorise the next rule of thumb:
Rule of Thumb
Number of possibilities
Number of possibilities to skip
=
3
Or, in plain mathematics:
n
m
=
3
Of course the rule of thumb is an approximation.
In the next table you see how [n] and [m] are exactly related for
values of n from n=1 to n=
Although it’s nice to have a "rule of thumb", don’t forget to decide on your gutfeeling as well.
Mixing intuition, experience and rules of thumb, guarantees the ultimate best choice.
Original blog by Jos Berkemeijer / July 2002/ Updated : April 2013
Whether you're an actuary, investment manager, HR-manager of respected consumer, in real life you often have to take a decision in a situation where you have to pick out "the best" opportunity out of "n" possibilities. Mostly in a situation where you (ex ante) are only limited aware about what you can expect in terms of quality or quantity.
Some examples:
Making the right investment
You want to make an investment today. Every day your stockbroker offers you about 20 investment opportunities. Your budget allows you to make only one investment today and it should be the best one. How can you be sure to pick the right one?
You have only limited time (say about 10 minutes) for each investment to decide; after that, you'll have to wait for the next offer.
Selecting the best candidate for the job You’re the HR-manager of a certain company. Your external HRM-advisor promised you to present 10 potential candidates for a certain vacancy. After each candidate you have to decide wetter you accept him/her or wetter you go one for a possible better candidate. You want the best candidate. What can you do?
Applying for the best job
You solicited for a new job. Six companies have invited you for a visit. After each visit you are obliged to say wetter you take the job or not. You want the best job. What is wise to do?
Buying a new car
You want to buy a new car. Although the price of that car is fixed, every dealer gives a quick-decision discount.
You decide to visit 7 dealers. After each visit you have to decide wetter you "buy" or "let go" (the dealer will not accept that you come back later after you came to the conclusion that he was after all the best deal).
You want the highest discount you can get; How can you manage?
Optimal Strategy?
In each of these cases you can ask yourself: what is the optimal strategy? Take the first opportunity or wait until the last? Skipping some opportunities or take the median opportunity?
In decision theory literature these kind of problems are known as "Best Choice Problems" (BCP's). More specific the above decision problems are often described as "The Sultan's Dowry Problem" or "The Secretary Problem".
This type of deceision problem is characterised by the following assumptions:
You want "the best" choice out of "n" possibilities
You handle each opportunity after another. After each opportunity you have to decide whether you take the offer or go further (you can’t come back on your decision later).
You only have limited knowledge about the group of "n" possibilities (in terms of quality or quantity)
Solution
The best strategy in these kind of cases is to wait (don’t choose) until the first "m" possibilities of the total number of opportunities "n" have passed. After these "m" possibilities you accept the first offer that is "better" than the one you've had until the moment of decision. The word "better" stands for "better candidate", "better financial offer", etc.
If you’re interested in the mathematical theory behind this kind of problems, click on one of the links below:
As you perhaps noticed in using The Best Choice Calculator, there is a close relation between the number of possibilities [n] and the number of opportunities you had to skip [m].
When we have to take decisions in "real life", we do not (yet) have a build-in computer-chip in our head to calculate for each [n] the corresponding value [m]. In this case all you have to do is to memorise the next rule of thumb:
Rule of Thumb
Number of possibilities
Number of possibilities to skip
=
3
Or, in plain mathematics:
n
m
=
3
Of course the rule of thumb is an approximation.
In the next table you see how [n] and [m] are exactly related for
values of n from n=1 to n=
Although it’s nice to have a "rule of thumb", don’t forget to decide on your gutfeeling as well.
Mixing intuition, experience and rules of thumb, guarantees the ultimate best choice.
Original blog by Jos Berkemeijer / July 2002/ Updated : April 2013