Improved bounds for the symmetric rendezvous search problem on the line

Q. Han (qhanunb.ca)
D. Du (dduunb.ca)
J. C. Vera (jveraandrew.cmu.edu)
L. F. Zuluaga (lzuluagaunb.ca)

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 apart between the two players is 2. 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 may 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.

Keywords: symmetric rendezvous search, game theory, on-line algorithm and competitive analysis, approximation algorithm

Category 1: Combinatorial Optimization

Category 2: Other Topics (Game Theory )

Category 3: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation: Working paper, Faculty of Business Administration, University of New Brunswick, May 2006.

Download: [PDF]

Entry Submitted: 05/24/2006
Entry Accepted: 05/25/2006
Entry Last Modified: 09/30/2006

Modify/Update this entry