Suppose there is a graph G, whose vertices are letters in an alphabet A and in which adjacency means that the letters can be confused in a transmission.
We survey the classical multi-armed bandit problem and discuss several variations such as the problem of stochastic search in a forest and the union branching bandit problem.
A path from $s$ to $t$ on a polyhedral terrain is descending if the height of a point $p$ never increases while we move p along the path from $s$ to $t$.
A typical problem in network design is to find a subgraph H of a given graph G such that H satisfies some connectivity requirements and has minimum cost.
