In a rendezvous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider two seekers in the plane. This is a one sided problem since Seeker 1 begins at a predetermined point O. Seeker 2 begins at one of a finite set of points xi with...

Let C be a field of subsets of a set I. It is well known that the space FA of all the finitely additive games of bounded variation on C is the norm dual of the space of all simple functions on C. In this paper we prove that the space BV of all the games of bounded variation on C is the norm dual...