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

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

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