The problem of choosing deals when you come across them sequentially is well studied and has applications in many fields - I am sharing links here because someone starting out may find it useful to think about their process from this lens.
https://en.wikipedia.org/wiki/Odds_algorithm
https://en.wikipedia.org/wiki/Secretary_problem
Optimal company selection (stopping) time
by a searcher from Princeton University
More on Searchfunder
Searchfunder is an online community and toolkit for searchfunds. Over 80% of those involved in searchfunds maintain a Searchfunder.com account to help them network, problem solve challenges, and keep up with the industry.
We maintain partnerships with database providers that make searching more effective, efficient and affordable along with features that help searchers find deals and investors and vice versa.
We maintain partnerships with database providers that make searching more effective, efficient and affordable along with features that help searchers find deals and investors and vice versa.
But, if it were applied to the Search, maybe we could assume that deal flow is linear over time and we could assume that it takes some time to start seeing good deal flow, let's say 6 months, and after that you can apply the 1/e rule. So for a 24 month search, it would be the most interesting deal after 6+(24-6)/e = ~13 months of search.