The Secretary Problem says you cannot recall a rejected applicant, so optimal stopping means rejecting good people permanently by design. Aditya Athalye and one colleague hiring QA engineers in Pune for Clojure work simply ignored that constraint — and kept the door open.
The loop they ran:
- Rejections came with an invitation to re-apply later, plus opt-in curriculum and weekly office hours for anyone wanting to learn Clojure
- A 24-hour turnaround promise to every candidate, with an open invitation to ping if it slipped
- Never ghost anybody — a quick no beats a “yes, but” three months later
- All screening by email, every email demanding a written answer about something relevant to that stage
- Coding assignments capped near fifteen minutes for the candidate’s level, then a mandated refactor with a different design
- Decisions fully async and written: two yes votes advance, one yes and one no is a reject, both logged in the ATS within 24 hours
- The first email listed deal-breakers in advance — mandatory Clojure, compensation ballpark, on-call expectations, review strictness
Results: five hires from about 300 inbound, each productive within a month, all of them tenured four to ten years, several moving into backend and product. They also hired a strong engineer through the word of mouth of a candidate they had rejected but supported.
The lesson is not that this loop is replicable in every company. It is that the binding constraint was self-imposed, and that running hiring as an engineering system — SLAs, written decisions, small reversible steps, candidates treated as people with limited time — is cheap and measurable.