meeting problem: to stay or to go

I am a physist, but this life problem has been bothering me for a long time. Sorry if it is too easy.

Suppose you are in a supermarket with your friend shopping. At some moment you noticed that you lost your friend. The question is what is the fastest strategy to find your friend: 1) search him; or 2) just stay at one place, waiting for him/her.

To make it purely mathematical problem some simplifications are to be made. Your friend is looking for you. Search in the problem is random, it is Brownian motion. In other terms, whether probabilities of collision of the particles in the two strategies are equal? If no, what is the ratio of them? Reformulated strategies;
1) two Brownian particles are absolutely the same - the same displacement every time and the same rate (search strategy);
2) trajectory of one particle must intersect the other motionless one, i.e. point (stay strategy).

I came to answer that 'search' strategy is faster times than 'stay' one, but I am not sure, because it is just consideration, not rigorous proof.

Re: meeting problem: to stay or to go

Originally Posted by brownian

I am a physist, but this life problem has been bothering me for a long time. Sorry if it is too easy.

Suppose you are in a supermarket with your friend shopping. At some moment you noticed that you lost your friend. The question is what is the fastest strategy to find your friend: 1) search him; or 2) just stay at one place, waiting for him/her.

To make it purely mathematical problem some simplifications are to be made. Your friend is looking for you. Search in the problem is random, it is Brownian motion. In other terms, whether probabilities of collision of the particles in the two strategies are equal? If no, what is the ratio of them? Reformulated strategies;
1) two Brownian particles are absolutely the same - the same displacement every time and the same rate (search strategy);
2) trajectory of one particle must intersect the other motionless one, i.e. point (stay strategy).

I came to answer that 'search' strategy is faster times than 'stay' one, but I am not sure, because it is just consideration, not rigorous proof.

Thank you

Hi brownian,

Can you explain how you got the answer, what you used to get it etc. Then we may be able to help.

Re: meeting problem: to stay or to go

EDIT: Corrected an algebra error which affects result [2] but not the overall conclusionEDIT 2: Corrected an incorrect assumption in result [1] which doesn't change the result.

PS: Im not totally sure the density functions i wrote can be compared in the way i'm comparing them!

This is quite a long and probably confusiong post, so i'll break down what ive done

What ive done
I dont have a ratio (although i suspect it may be 1/2). However i think it can be proved that the 2 person search is faster.

Notation
Model the x and y coordinates of each particle as independant weiner processes with drift 0 and scale .

eg

This is convenient later as the two person search can be re-expressed as a 1 person search with a modified sigma.

Results[1] The two person search is equivalent to a 1 person search with

[2]The probability density of collisions in a 2-man search at time is equal to the density of collisions in a 1-man search at time

[3]Finally (and im not sure about this bit), since the chance of a collision occuring is obviously an increasing function of time, (2) is a sufficient condition for the 2-person search to finish faster on average. I dont know how to calculate how much by.

Working - Part 1: Show that the 2 person search problem is equivalent to the 1 person search problem with a different search speed

Consider the 2 person search. I assume that for each searcher:
The X coordinate of each particle follows a weiner process with drift 0 and scale
The Y coordinate of each particle follows a weiner process with drift 0 and scale

The values of each coordinate are independently distributed at time t as [tex]N(0,\sigma t)[\tex]. It is well known that the difference between 2 independent normal distribution is also normal. It immediately follows that:

the difference in X coordinates follows a weiner process with drift 0 and scale
the difference in Y coordinates follows a weiner process with drift 0 and scale

If both differences are 0 then they collide. Key point: A collission occurs if two weiner processes with scale and drift 0 take the value 0 at the same time.

1 person search problem
One guy stays at the origin and moves with scale parameter . make his speed a parameter, ie his X and Y coordinates follow independant weiner processes with drift 0 and scale

They collide if the searching player returns to the origin. ie if two independant weiner processes with drift 0 and scale have value 0 at the same time.

This is the same as the 2-person search process if . So it is sufficient to compare the performance of a 1-person search for the scale values and

Working - Part 2 Find the relationship between and the performance of a 1-person search

Let X and Y be the X and Y coordinates of the searcher. Assume each follows a weiner process with scale . Since X and Y are independent the joint probability density is just the product of 2 marginal normal densities of distribution :

Collissions occur when x=y=0, so the density of a collision at time t if the scale parameter is is :

From result [1] we know already that a 2 person search is the same as a 1-person search with parameter . hence the density of collisions in the 2-man search is . Now, lets compare: