The University of Southampton
University of Southampton Institutional Repository

Many-player rendezvous search: stick together or split and meet?

Many-player rendezvous search: stick together or split and meet?
Many-player rendezvous search: stick together or split and meet?
Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies - the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times.
rendezvous search, multiplayer games
710-721
Thomas, L.C.
a3ce3068-328b-4bce-889f-965b0b9d2362
Pikounis, M.
6b389e7c-4e40-45d8-88f0-064515fb354d
Thomas, L.C.
a3ce3068-328b-4bce-889f-965b0b9d2362
Pikounis, M.
6b389e7c-4e40-45d8-88f0-064515fb354d

Thomas, L.C. and Pikounis, M. (2001) Many-player rendezvous search: stick together or split and meet? Naval Research Logistics, 48 (8), 710-721. (doi:10.1002/nav.1043).

Record type: Article

Abstract

Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies - the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times.

This record has no associated files available for download.

More information

Published date: 2001
Keywords: rendezvous search, multiplayer games

Identifiers

Local EPrints ID: 35748
URI: http://eprints.soton.ac.uk/id/eprint/35748
PURE UUID: 0dea9709-ce8a-418c-ab9e-d535398c4626

Catalogue record

Date deposited: 22 May 2006
Last modified: 15 Mar 2024 07:54

Export record

Altmetrics

Contributors

Author: L.C. Thomas
Author: M. Pikounis

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×