GoKawiilEssay recounts 2014 Clojure QA hiring that sidestepped the 'Secretary Problem'
A blog post reflects on a 2014 hiring effort to find QA staff in Pune, India willing to learn Clojure to test a large SaaS backend, describing it as an example of avoiding the classic 'Secretary Problem' from Optimal Stopping Theory by not permanently rejecting candidates once passed over. The author, writing with colleague Mayank's case as the anecdote, contrasts this non-zero-sum hiring approach with what they describe as a currently brutal, post-ZIRP software hiring market in 2026.
GoKawiil's interpretation of the reporting above, not reported fact.
The piece suggests that rigid, one-shot rejection-based hiring models may be needlessly limiting good-fit hires, especially for niche technical skills like Clojure, and that revisiting rejected candidates could offer a less adversarial alternative. Since this is an individual's reflective essay rather than industry data, its claims about hiring norms and market conditions represent the author's opinion rather than established fact.
- The author frames typical hiring as a zero-sum process modeled by the 'Secretary Problem' in Optimal Stopping Theory.
- A 2014 anecdote about hiring QA staff in Pune to learn Clojure is presented as a case where this constraint was avoided.
- The author argues post-ZIRP hiring conditions in 2026 remain difficult, attributing some of this to self-inflicted structural issues in the industry.
Source: evalapply.org — Aditya Athalye, 2026-09-22
Published there as: “Side-stepping the Secretary Problem, unwittingly”
Read the original report → The summary and analysis above are GoKawiil's own, written from reporting by the source above. Facts and quotes belong to the original publisher.