Consider a weighted n-vertex, m-edge graph G with designated source s and destination t. The topology of G is known, while the edge weights are hidden. Our goal is to discover either the edge weights in the graph or a shortest (s, t)-path. This is done by means of agents that traverse different (s, t)-paths in multiple rounds and report back the total cost they incurred. Various cost models are...
