Side-stepping the Secretary Problem, unwittingly

A hiring anecdote reframes the Secretary Problem (optimal stopping theory) by removing its key constraint: once rejected, a candidate cannot be recalled. Faced with hiring Clojure-capable tester-programmers in Pune in 2013-14, two engineers kept the door open for reapplications and offered opt-in learning support - curriculum plus weekly office hours - to cultivate promising but underqualified candidates. The concrete payoff: about five hires from ~300 applicants, each productive within a month, later shifting into backend and product roles, and achieving unusually long tenures (four to ten years). Word-of-mouth from that learning support also produced at least one additional strong hire. The narrative argues this practice effectively sidestepped the secretary-problem tradeoff by allowing revisits and investing in candidate development rather than treating hiring as strictly zero-sum.

The account further lays out a practical, humane hiring playbook: a strict 24-hour response SLA, never ghosting, routing all communication through an ATS with written decision notes, keeping synchronous interviews for late stages, using call playbooks and structured rubrics, and optimizing for asynchronous fast decisions. It critiques conventional multi-stage, FAANG-style funnels as adversarial and inefficient and recommends non-zero-sum, learning-oriented hiring as a default, noting only a brief caveat about possible HR or legal implications of explicit reapplication and training offers.