Do you know that the random() function in software programming runs with a "seed". So
random(1) always produces the same results. so does random(2). So if some applicant knew which "seed" was run by the seelction algorithm and if the same person could ensure that he applies at the correct time, he/she could make sure that they are chosen.
I hear you shouting: "how could they have known which "seed" was used and what time they should apply so that they receive the winning ranking."
This is exaclt what I am saying.
They could NOT HAVE KNOWN.
The same goes for the current selection: "NOBODY KNEW!" of the selection process so nobody could do anything to gain an unfair advantage.
Assume that the software was supposed to choose selectees uniformly (in respect to Application Date & Time) from among all applicants.
There are 100,000 selectees. All applications happened in 30 days = 720 hours.
So this means that every hour (to ensure uniform distribution in respect to Applicaton date & time) -> 100,000 / 720 = 140 selectees must be chosen.
Would this mean that if I apply at 3am in the morning when there are less people applying, I have a greater chance of winning?
Or should the uniformity be by the "minute".
It means that 2.3 people should be selected every minute.
Would this mean that if I apply for myself, my wife and my children within the same minute from paralel computers, I can increase my chance of winning?
Or should the uniformity be by the "day".
It means that 3333 people should be selected every day.
So which day would the least number of people apply. I would guess ti would be on the 15th day.
Any kind of KNOWLEDGE can give you an unfair adantage. If there is NO KNOWLEDGE, than the selectees could not have manipulated the system. Hence, the outcome is a random group.
If someone were to check the current selectees, they would find that, all education levels, ages, etc are uniformly distributed which is the desired result.
