haha, i love less wrong. this reminds me of a hiring algorithm as well that was proposed as optimal: - you have N candidates and one position and limited time. how do you make the optimal hire without going through all interviews? - the approach ended up being: talk to N/2 people, pick the top person from N/2 as benchmark, hire the first person that is better than (N/2) in subsequent interviews (disclaimer: this isn't how Dendron does interviews 😅 - also, we're hiring for a frontend web developer)