optimization
Rendezvous on a line โ โ โ
Author(s): Alpern
Problem Two players start at a distance of 2 on an (undirected) line (so, neither player knows the direction of the other) and both move at a maximum speed of 1. What is the infimum expected meeting time (first time when the players occupy the same point) which can be achieved assuming the two players must adopt the same strategy?
Keywords: game theory; optimization; rendezvous