  


Improved bounds for the symmetric rendezvous search problem on the line
Q. Han (qhanunb.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 theoryparticularly 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, online algorithm and competitive analysis, approximation algorithm Category 1: Combinatorial Optimization Category 2: Other Topics (Game Theory ) Category 3: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Citation: Operations Research, MayJune 2008; 56: 772  782 Download: Entry Submitted: 05/24/2006 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  