Optimal Foraging Theory

What It Is

An animal feeding in one place eventually faces a decision: keep extracting the resources that remain, or spend energy searching somewhere else. Staying has a known return that may be declining. Leaving costs energy before there is any assurance of finding food.

Optimal foraging theory (OFT) models this resource-acquisition problem. Developed in behavioral ecology during the 1960s and 1970s, it examines what animals eat, where they search and when they move. The organism has finite energy, resources are unevenly distributed, and their locations are visible only through imperfect cues. A useful search must acquire resources before the reserves run out.

The objective is to maximize energy gained minus energy spent searching, without exceeding the available budget. This maps directly to startup survival: runway supplies the finite reserve, product-market fit is unevenly distributed across possible markets, search consumes runway and signals about fit are imperfect. Despite the different physical substrates, the mathematics are identical: each is resource-constrained search under uncertainty.

The article uses foraging to reason about exploration and exploitation; the useful choice depends on costs and changing returns.

Read this diagram

Inspect the current return branches into Keep using this patch; Spend resources searching.

The Central Trade-Off

Exploitation extracts resources from a known location. The gain is known because the resource has been discovered. The organism is already there, so the energy cost is low. The risk is depletion.

Exploration searches for a new location. Travel and search raise the cost, while the possible gain remains unknown. The organism may find nothing and exhaust its energy.

The comparison is:

E_total = E_current_patch × P_patch_remains - C_extraction
        vs
E_total = E_new_patch × P_find_patch - C_search - C_travel

Where:
  E = expected energy gain
  P = probability
  C = cost in energy units

Leaving is worthwhile when the expected return from a new search exceeds the return from continuing in the current patch. The marginal value theorem gives a rule for that transition.

The Marginal Value Theorem

An organism should leave a patch when its marginal rate of energy gain falls below the average rate available across the habitat. The relevant quantity is the return on the next interval of effort, rather than the total already collected.

Energy ↑
Gain   |     ╱─────  (Diminishing returns in patch)
       |   ╱
       | ╱
       |╱___________________
       0    Time spent in patch →

Leave when: (dE/dt)_patch < (E/T)_average_habitat

For a startup, the corresponding comparison is information gained per unit of runway. Continue in the current direction while its marginal information rate exceeds the expected average rate available after a pivot. When local insights diminish and another direction offers a higher expected rate, pivot.

The rate alone does not settle the decision. Confidence and the cost of validation also affect the expected return:

An expected-value calculation combines these factors under the remaining resource constraint.

Patch Choice and Search Patterns

A search can use no cues, environmental cues or other searchers' results. Each changes how much space must be examined.

The mosquito model combines heat, CO2 and movement to predict where blood is available. That is informed search. Five mosquitoes already feeding at a location provide social information: blood has been found there, rather than merely predicted from a cue.

Startups have corresponding search strategies:

Most successful startups use the hybrid approach. Others' product-market fit narrows the search space. Further observation can then locate an underserved niche inside that validated area. Following a demonstrated gradient and testing cheaply before committing resources preserves more of the search budget than beginning randomly.

Sensor Reliability and Search Efficiency

Search efficiency depends on how accurately a cue predicts a resource. OFT represents detection probabilistically:

P(find resource | cue present) = True Positive Rate
P(find resource | cue absent) = False Positive Rate

Expected search cost = C_per_location / (TPR - FPR)

A larger difference between the true-positive and false-positive rates lowers expected search cost. Poor calibration sends the organism to locations where the resource is absent, consuming energy without a return.

For startup sensors, the comparison is:

Expressed interest and hypothetical commitment have false-positive rates above their true-positive rates. Relying on those sensors guarantees search failure through systematic misdirection. Integrating multiple sensors reduces false positives and makes the search better match the resource distribution.

The Giving-Up Time Problem

Leaving too early discards information still available in the patch. Staying too long spends the remaining reserve on a depleted location. The optimal giving-up time balances the opportunity cost of staying against travel cost and the risk that the next patch is worse:

Cost_staying = Opportunity_cost_of_better_patches × Time_staying
Cost_leaving = C_travel + Risk_new_patch_is_worse

Optimal giving-up time when: Cost_staying = Cost_leaving

For a startup, the persistence rule is:

Persist while: (Learning_rate_current × Runway_remaining) > (E[Learning_rate_new] - C_pivot)

Where:
  Learning_rate = information gained per month of runway
  C_pivot = cost of context switch and new learning curve

Four judgments are required. Is the current direction still producing insights? What learning rate is realistically available in another direction? How much runway will the switch consume before reaching an equivalent information state? How much runway remains to carry out either strategy?

A premature pivot abandons a useful gradient before its local information has been extracted. A late pivot consumes runway after that information is exhausted. Timing depends on an honest estimate of all four variables.

Integration with Mechanistic Framework

OFT gives expected value a mathematical structure under resource constraints:

$EV = (E_{\text{resource}} \times P_{\text{find}}) - C_{\text{search}}$

Execute if $EV > 0$ and $EV > EV_{\text{alternative}}$.

This is equivalent to the expected-value formula used for motivation:

$EV = \frac{\text{Reward} \times \text{Probability}}{\text{Effort} \times \text{Temporal distance}}$

Both allocate resources under uncertainty. Ecology and psychology use different terms for equivalent mathematics.

Prevention architecture applies the same approach to attention. Removing frequent, low-value temptations such as phones and notifications excludes them from the search space. This corresponds to habitat selection: avoiding predator-rich or resource-poor places confines the search to areas with a higher yield.

Related Concepts

• Startup as a Bug applies OFT to organizational survival.
• Cybernetics describes control and feedback under constraints.
• Expected Value provides the resource-allocation calculation.
• Information Theory measures information's contribution to reducing uncertainty.
• Prevention Architecture constrains search through habitat selection.
• Activation Energy explains the energy costs of different search strategies.
• Question Theory examines search algorithms and their computational costs.