The Department of Computer Science at the University of Cyprus cordially invites you to the Colloquium entitled:
Network Search from a Game Theoretic Perspective
Speaker: Prof. Steve Alpern
An object (hider) is at an unknown point on a given network Q, not necessarily at a node. Starting from a known point (known to the hider), a searcher moves around the network to minimize the time T required to find (reach) the hider. The hider's location may be a known distribution or one chosen by the hider to make T large. We study the Bayesian problem where the hider's distribution over Q is known and also the game problem where it is chosen by an adversarial hider. Two types of searcher motion (continuous search or expanding search) are considered.
Steve Alpern first studied game theory under Oskar Morgenstern at Princeton and became interested in Search Games through contact with Rufus Isaacs. After many years at the London School of Economics he is now in the Operational Research Group at the University of Warwick.
Recorded Video available through
|Sponsor: The CS Colloquium Series is supported by a generous donation from