Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance

References

• Alpern S. The rendezvous search problem. SIAM J. Control Optim. (1995) 33(3):673–683Crossref, Google Scholar
• Alpern S., Beck A. Asymmetric rendezvous on the line is a double linear search problem. Math. Oper. Res. (1999) 24(3):604–618Link, Google Scholar
• Alpern S., Gal S. Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. (1995) 33(4):1270–1276Crossref, Google Scholar
• Anderson E. J., Essegaier S. Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. (1995) 33:1637–1642Crossref, Google Scholar
• Baston V. J. Two rendezvous search problems on the line. Naval Res. Logist. (1999) 46:335–340Crossref, Google Scholar
• Baston V. J., Gal S. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution. SIAM J. Control Optim. (1998) 36(6):1880–1889Crossref, Google Scholar
• Gal S.Search Games (1980) (Academic Press, New York) Google Scholar
• Gal S. Rendezvous search on the line. Oper. Res. (1999) 47(6):974–976Link, Google Scholar
• Gal S., Chazan D. On the optimality of the exponential functions for some minimax problems. SIAM J. Appl. Math. (1976) 30:324–348Crossref, Google Scholar
• Howard J. V. Rendezvous search on the interval and the circle. Oper. Res. (1999) 47(4):550–558Link, Google Scholar
• Juniper T., Yamashita C. The conservation of Spix's macaw. Oryx (1990) 24:224–228Crossref, Google Scholar
• Lim W. S., Alpern S. Minimax rendezvous on the line. SIAM J. Control Optim. (1996) 34(5):1650–1665Crossref, Google Scholar
• Lim W. S., Alpern S. Minimax triple rendezvous on the line: corrections and extensions. (1997) . PreprintGoogle Scholar
• Lim W. S., Alpern S., Beck A. Rendezvous search on the line with more than two players. Oper. Res. (1997) 45:357–364Link, Google Scholar