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...

A search game on a finite and complete graph is studied between a (immobile) hider and a seeker. A strategy for the hider is to choose a node where he hides, except for a specified node. A strategy for the seeker is an ordering of nodes in which the seeker starts at the specified node, examines...

<Para ID="Par1">In this paper we suggest a new class of search games, namely, screening and hiding versus search games. This new class of search games is motivated by the book Search and Screening by Koopman who is the founder of the modern search theory. In our game a hider is not just trying to find the best...</para>

We define a duality of solutions in coalitional games that we call a twisted duality. This twisted duality extends the rule of self-duality in bankruptcy problems. After showing that the prekernel and prenucleolus exhibit twisted duality, we define a twisted reduced game property and...

It is shown that the prekernel and the pre-nucleolus of a cooperative game coincide with the kernel and the nucleolus for the reasonable set of the game respectively.