Searchers in Networks Talk

For those of you in Cincinnati or nearby this week, Full announcement here.

Update:  Because of weather issues, this talk has been delayed until January 28 at the same time and place.

The Department of Quantitative Analysis & Operations Management at the University of Cincinnati is pleased to welcome Professor Cole Smith from the University of Florida to the QAOM Research Seminar Series on Friday, January 21 at 1:30PM. ...  . If you would like to schedule a one-on-one meeting with Professor Smith, please contact Tricia Burger at tricia.burger@uc.edu.

A Survey of Search Problems on Networks, Cole Smith, Ph.D.  Professor, Industrial and Systems Engineering University of Florida ... Friday, January 21, 2010 – 1:30 p.m. – 219 Carl H. Lindner Hall

Abstract: The problem of deploying and controlling a set of searchers on a network to locate a hidden target is referred to as a search game. There are countless variations of this game, depending on, e.g., whether or not the target is mobile, and the searchers’ communication and control capabilities. This talk will examine classical results in this field, discuss contemporary search literature, and explore research directions in this field as driven by future security challenges. In particular, we will explore recent game theoretic and mathematical programming techniques that have been employed to solve such problems, and applications of contemporary interest to researchers and practitioners worldwide ...  "