IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v56y2008i3p772-782.html
   My bibliography  Save this article

Improved Bounds for the Symmetric Rendezvous Value on the Line

Author

Listed:
  • Qiaoming Han

    (School of Engineering and Management, Nanjing University, Nanjing 210093, China)

  • Donglei Du

    (Faculty of Business Administration, University of New Brunswick, Fredericton, New Brunswick, Canada E3B 5A3)

  • Juan Vera

    (Department of Management Sciences, Faculty of Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1)

  • Luis F. Zuluaga

    (Faculty of Business Administration, University of New Brunswick, Fredericton, New Brunswick, Canada E3B 5A3)

Abstract

A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance between the two players is two. We show that the symmetric rendezvous value is within the interval (4.1520, 4.2574), which considerably improves the previous best-known result (3.9546, 4.3931). To achieve the improved bounds, we call upon results from absorbing Markov chain theory and mathematical programming theory---particularly fractional quadratic programming and semidefinite programming. Moreover, we also establish some important properties of this problem, which could be of independent interest and useful for resolving this problem completely. Finally, we conjecture that the symmetric rendezvous value is asymptotically equal to 4.25 based on our numerical calculations.

Suggested Citation

  • Qiaoming Han & Donglei Du & Juan Vera & Luis F. Zuluaga, 2008. "Improved Bounds for the Symmetric Rendezvous Value on the Line," Operations Research, INFORMS, vol. 56(3), pages 772-782, June.
    • Handle: RePEc:inm:oropre:v:56:y:2008:i:3:p:772-782
    DOI: 10.1287/opre.1070.0439
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1070.0439
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1070.0439?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Wei Shi Lim & Steve Alpern & Anatole Beck, 1997. "Rendezvous Search on the Line with More Than Two Players," Operations Research, INFORMS, vol. 45(3), pages 357-364, June.
    2. Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
    3. Alpern, Steve & Beck, Anatole, 1997. "Rendezvous search on the line with bounded resources: expected time minimization," European Journal of Operational Research, Elsevier, vol. 101(3), pages 588-597, September.
    4. Steve Alpern & Anatole Beck, 2000. "Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance," Operations Research, INFORMS, vol. 48(3), pages 498-501, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Leone, Pierre & Buwaya, Julia & Alpern, Steve, 2022. "Search-and-rescue rendezvous," European Journal of Operational Research, Elsevier, vol. 297(2), pages 579-591.
    2. Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.
    3. Pierre Leone & Steve Alpern, 2022. "A Symbolic Programming Approach to the Rendezvous Search Problem," SN Operations Research Forum, Springer, vol. 3(1), pages 1-29, March.
    4. Alpern, Steven & Lidbetter, Thomas, 2015. "Optimal trade-off between speed and acuity when searching for a small object," LSE Research Online Documents on Economics 61504, London School of Economics and Political Science, LSE Library.
    5. Pierre Leone & Steve Alpern, 2018. "Rendezvous search with markers that can be dropped at chosen times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 449-461, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
    2. Leone, Pierre & Buwaya, Julia & Alpern, Steve, 2022. "Search-and-rescue rendezvous," European Journal of Operational Research, Elsevier, vol. 297(2), pages 579-591.
    3. Steve Alpern & Anatole Beck, 1999. "Asymmetric Rendezvous on the Line Is a Double Linear Search Problem," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 604-618, August.
    4. Edward J. Anderson & Sándor P. Fekete, 2001. "Two Dimensional Rendezvous Search," Operations Research, INFORMS, vol. 49(1), pages 107-118, February.
    5. Vic Baston, 1999. "Note: Two rendezvous search problems on the line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(3), pages 335-340, April.
    6. Steve Alpern & Wei Shi Lim, 2002. "Rendezvous of three agents on the line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(3), pages 244-255, April.
    7. Pierre Leone & Steve Alpern, 2018. "Rendezvous search with markers that can be dropped at chosen times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 449-461, September.
    8. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.
    9. Steve Alpern & Anatole Beck, 1999. "Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting," Operations Research, INFORMS, vol. 47(6), pages 849-861, December.
    10. Andreas Blume & April Mitchell Franco & Paul Heidhues, 2021. "Dynamic coordination via organizational routines," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(4), pages 1001-1047, November.
    11. Steve Alpern & Thomas Lidbetter, 2014. "Searching a Variable Speed Network," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 697-711, August.
    12. Richard Weber, 2012. "Strategy for Quickest Second Meeting of Two Agents in Two Locations," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 123-128, February.
    13. Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
    14. Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
    15. Steve Alpern & Li Zeng, 2022. "Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks," Dynamic Games and Applications, Springer, vol. 12(1), pages 288-311, March.
    16. L.C. Thomas & M. Pikounis, 2001. "Many‐player rendezvous search: Stick together or split and meet?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 710-721, December.
    17. Steve Alpern & Anatole Beck, 2000. "Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance," Operations Research, INFORMS, vol. 48(3), pages 498-501, June.
    18. Richard Weber, 2012. "Optimal Symmetric Rendezvous Search on Three Locations," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 111-122, February.
    19. Alpern, Steve & Katrantzi, Ioanna, 2009. "Equilibria of two-sided matching games with common preferences," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1214-1222, August.
    20. Alpern, Steve, 2008. "Line-of-sight rendezvous," European Journal of Operational Research, Elsevier, vol. 188(3), pages 865-883, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:56:y:2008:i:3:p:772-782. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.