Screening and hiding versus search
type: Item
instance of: scholarly article
title: Screening and hiding versus search
zbMATH Open document ID: 1314.91041
author: Andrey Garnaev
author: Kensaku Kikuta
published in: Mathematical Methods of Operations Research
publication date: 2015-01-19T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 6387654
zbMATH Keywords: search game
zbMATH Keywords: zero-sum game
reviewed by: Alexander Guterman
MaRDI profile type: Publication
full work available at URL: s00186-014-0479-4
OpenAlex ID: W2056085911
cites work: The theory of search games and rendezvous.
cites work: The search game on a network with immobile hider
cites work: A search game with a protector
cites work: Application of the fundamental theorem of games to an example concerning antiballistic missile defense
cites work: Q5534710
cites work: Search Games with Mobile and Immobile Hider
cites work: Search game in a rectangle
cites work: Technical note: Find a hidden “treasure”
cites work: A searcher versus hider game with incomplete information about search resources
cites work: Search allocation game
cites work: HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
cites work: Initial point search on weighted trees
cites work: Q3833854
cites work: Stochastic search in a convex region
cites work: Q3775319
cites work: Some games of search on a lattice
DOI: 10.1007/S00186-014-0479-4
description: scientific article; zbMATH DE number 6387654