Screening and hiding versus search
The authors introduce a new class of search games which are called screening and hiding versus search games. In this game, hider is not just trying to find the best places to hide resources from a searcher, but also applies efforts to screen (protect) their allocations, making it more difficult for the searcher to find them. For the suggested 2 players zero-sum game the authors found the equilibrium strategies of both players and prove the existence of the equilibrium. The other scenario for this game can be taken from network's security. Note that under this scenario the attacker has only one parameter (offensive allocation among network's nodes) to control, as far as the defender has two parameters to control: defensive budget and stored data which can increase flexibility of defensive strategy. The game under consideration can answer the question how joint control over data and defence allocation can reduce risks to lose this data.
scientific article; zbMATH DE number 6387654
scientific article