http://openproblemgarden.org/op/rendezvous_on_a_line Comments for "Rendezvous on a line" en http://openproblemgarden.org/op/rendezvous_on_a_line <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/alpern_steve">Alpern</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/unsorted">Unsorted</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Problem</b>&nbsp;&nbsp; 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 <img class="teximage" src="/files/tex/201b5ff8bf9045c34a583adc2741b00adf1fd14c.png" alt="$ R $" /> (first time when the players occupy the same point) which can be achieved assuming the two players must adopt the same strategy? </div> </tr></td> </table> </td> </tr> </table> Alpern, Steve game theory optimization rendezvous Unsorted http://openproblemgarden.org/op/rendezvous_on_a_line#comment Fri, 21 Sep 2007 20:43:18 +0200 mdevos 581 at http://openproblemgarden.org