University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Expanding Search on Networks

Expanding Search on Networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Felix Fischer.

This joint work with Tom Lidbetter considers searching a network in a different way, which we call expanding search. In the discrete case, where the Hider is restricted to hiding at one of the k nodes of a network Q, such a search is a sequence of distinct nodes n(1), n(2),...,n(k), where n1 is a given ‘root’ or ‘starting’ node, and every other node n(i) is adjacent to a previously searched node n(j), for some j<i. We consider both the Bayesian problem where the Hider distribution is known, and the search game where the Hider picks his node. The payoff is the expected search time. We also consider the case where the Hider can hide at any point on the network (where arcs have given lengths).

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity