The LSE 2010 Conference on Search Games and Rendezvous was held at the LSE this July, with participants from many countries. This year the conference was held in honour of the retirement of Anatole Beck, a leading figure in the development of the field. The conference received support from STICERD, the Mathematics Department and the Operational Research Group of the Department of Management. The conference was organized by Steve Alpern and Katerina Papadaki.
This year for the first time a contingent from the area of theoretical computer science attended the conference ard showed the original group (from applied mathematics and operations research) the way rendezvous problems are treated in their field. Their group avoids the Bayesian assumptions about the original positions that the operations research people usually make. There was a flow of ideas between the two groups and plans were made for a larger conference to be held in Leiden in 2012.
The conference was held over two days, Friday and Saturday 2-3 July. The Friday morning session had talks on rendezvous search in one or two dimensions by John Howard (LSE), Adrian Kosowski (Gdansk University of Technology, Poland) and Leszek Gasieniec (Liverpool). A fourth talk on (asynchronous) rendezvous was give on Saturday by Jurek Czyzowicz (Université du Québec, Canada).
The Friday afternoon session had talks on search problems with an antagonistic or motiveless Hider, given by Steve Alpern (LSE), Anatole Beck (Wisconsin, USA) and Shmuel Gal (Haifa, Israel). These talks focused on new approaches to classical problems.
The Saturday session featured talks by Tom Lidbetter (LSE) on a caching game between a scatter-hoarder such as a squirrel and a pilferer, by Robbert Fokkink (TU Delft, Netherlands) on accumulation games and Katerina Papadaki (LSE) on patrolling games on networks.
More details can be found at: