IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v48y2001i8p722-731.html
   My bibliography  Save this article

Rendezvous search when marks are left at the starting points

Author

Listed:
  • Vic Baston
  • Shmuel Gal

Abstract

Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 722–731, 2001

Suggested Citation

  • Vic Baston & Shmuel Gal, 2001. "Rendezvous search when marks are left at the starting points," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 722-731, December.
    • Handle: RePEc:wly:navres:v:48:y:2001:i:8:p:722-731
    DOI: 10.1002/nav.1044
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.1044
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.1044?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. Edward J. Anderson & Sándor P. Fekete, 2001. "Two Dimensional Rendezvous Search," Operations Research, INFORMS, vol. 49(1), pages 107-118, February.
    2. Crawford, Vincent P & Haller, Hans, 1990. "Learning How to Cooperate: Optimal Play in Repeated Coordination Games," Econometrica, Econometric Society, vol. 58(3), pages 571-595, May.
    3. 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.
    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. 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.
    3. 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. 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.
    3. Leone, Pierre & Buwaya, Julia & Alpern, Steve, 2022. "Search-and-rescue rendezvous," European Journal of Operational Research, Elsevier, vol. 297(2), pages 579-591.
    4. 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.
    5. Steve Alpern & Vic Baston, 2005. "Rendezvous on a Planar Lattice," Operations Research, INFORMS, vol. 53(6), pages 996-1006, December.
    6. Blume, Andreas & Franco, April Mitchell, 2007. "Decentralized learning from failure," Journal of Economic Theory, Elsevier, vol. 133(1), pages 504-523, March.
    7. Bosch-Domènech, Antoni & Vriend, Nicolaas J., 2013. "On the role of non-equilibrium focal points as coordination devices," Journal of Economic Behavior & Organization, Elsevier, vol. 94(C), pages 52-67.
    8. Sylvain Chassang, 2010. "Building Routines: Learning, Cooperation, and the Dynamics of Incomplete Relational Contracts," American Economic Review, American Economic Association, vol. 100(1), pages 448-465, March.
    9. Maarten C.W. Janssen, 1997. "Focal Points," Tinbergen Institute Discussion Papers 97-091/1, Tinbergen Institute.
    10. Houser, Daniel & Yang, Yang, 2024. "Learning language: An experiment," Journal of Economic Behavior & Organization, Elsevier, vol. 217(C), pages 547-559.
    11. Andonie, Costel & Kuzmics, Christoph, 2012. "Pre-election polls as strategic coordination devices," Journal of Economic Behavior & Organization, Elsevier, vol. 84(2), pages 681-700.
    12. Fölster, Stefan, 1991. "The Perils of Peer Review in Economics and Other Sciences," Working Paper Series 309, Research Institute of Industrial Economics.
    13. 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.
    14. Arnaud Z. Dragicevic, 2019. "Market Coordination Under Non-Equilibrium Dynamics," Networks and Spatial Economics, Springer, vol. 19(3), pages 697-715, September.
    15. Alós-Ferrer, Carlos & Kuzmics, Christoph, 2013. "Hidden symmetries and focal points," Journal of Economic Theory, Elsevier, vol. 148(1), pages 226-258.
    16. Alpern, Steve, 2008. "Line-of-sight rendezvous," European Journal of Operational Research, Elsevier, vol. 188(3), pages 865-883, August.
    17. Andreas Blume & April Franco, 2002. "Learning from failure," Staff Report 299, Federal Reserve Bank of Minneapolis.
    18. Geoffrey Heal & Howard Kunreuther, 2003. "You Only Die Once: Managing Discrete Interdependent Risks," NBER Working Papers 9885, National Bureau of Economic Research, Inc.
    19. Blume, Andreas, 2018. "Failure of common knowledge of language in common-interest communication games," Games and Economic Behavior, Elsevier, vol. 109(C), pages 132-155.
    20. Fuhai Hong & Xiaojian Zhao, 2017. "The emergence of language differences in artificial codes," Experimental Economics, Springer;Economic Science Association, vol. 20(4), pages 924-945, December.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:48:y:2001:i:8:p:722-731. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.