Abstract: Search on the half-line is one of the simplest instances of the search problems, going back to Bellman '63 and Beck '64. Deceptive simplicity of the average case formulation of this problem masks an intricate structure - namely that of a Hamiltonian mapping with coexisting chaotic and regular dynamics, unbounded invariant domains and other unexpected pathologies.

Joint work with Vadim Zharnitsky, UIUC.

Coffee will be served at 12:00 before the lecture
at Schreiber building 006