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

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

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

The division of a cake by two players is modelled by means of a game of timing in which the players have a probability of learning when their opponent acts. It is shown that the game has a unique Nash equilibrium when both players are non-noisy but that there are many Nash equilibria including...

We analyse a non-zero sum two-person game introduced by Teraoka and Yamada to model the strategic aspects of production development in manufacturing. In particular we investigate how sensitive their solution concept (Nash equilibrium) is to small variations in their assumptions. It is proved...