On the Cyclic Assumption of the Cow-Path Search Algorithm
The algorithm explores paths in a fixed cyclic order to solve the cow-path problem. It is proven optimal for $w=2$ and conjectured to be optimal for all $w eq 2$. The analysis involves defining states based on path frontiers and remaining weights, showing how step choices affect future expected costs.