Home > Department of Mathematics > Seminars > Conference on Search Games and Rendezvous

 

Conference on Search Games and Rendezvous

In honour of Anatole Beck

Schedule

pdf Abstracts

Session 1 - Rendezvous Search Problems  (Chair - Steve Alpern, LSE)

Friday 2nd June

H102 Connaught House - start time 10.30

Time

 

10.30 - 10.40


Welcome
- Steve Alpern (Chair)

10.40 - 11.10


John Howard (LSE) -
Rendezvous on an Interval

11.10 - 11.40


Adrian Kosowski -
Rendezvous of mobile agents in graphs

12.00 - 13.00


Leszek A Gasieniec
- Two Dimensional Rendezvous

13.00 - 14.30


Lunch - Brunch Bowl, 4th Floor, Main Building

 

Session 2 - Search Games (Chair - Katerina Papadaki, LSE)

Friday 2nd June

H102 Connaught House - start time 14.30

Time

 

14.30 - 15.10


Steve Alpern
- Search games on time-asymmetric trees

15.20 - 15.50


Anatole Beck
- Two Dimensional Search

16.00 - 16.30


Shmuel Gal
-  Coordinated linear search

 

Session 3 - Search Games (Chair - John Howard, LSE)

Saturday 3rd June

NAB LG09 New Academic Building - start time 14.00

Time

 

14.00 - 14.30


Tom Lidbetter
- The Squirrel-Pilferer nut hiding game

14.40 - 15.10


Robbert Fokkink
- Ruckle's Conjecture on Accumulation Games

15.20 - 16:00


Katerina Papadaki
- Patrolling games on networks

 

Back to Conference homepage|

 

Share:Facebook|Twitter|LinkedIn|