The search value of a set

Journal article (2017)

Authors

R.J. Fokkink Applied Probability - EEMCS
Ken Kikuta University of Hyogo
David Ramsey Wrocław University of Technology
Research Group
Applied Probability (EEMCS) (TU Delft)
Copyright: © 2017 R.J. Fokkink, Ken Kikuta, David Ramsey
DOI: https://doi.org/10.1007/s10479-016-2252-y
More Info
expand_more

Published Date

01-09-2017

Language

English

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Applied Probability

Abstract

We study search games in which the hider may hide in a finite number of locations. We assume that the cost of searching these locations does not depend on the order in which the locations are searched. From these assumptions we derive that the cost function is submodular, thus placing search games with an immobile hider in the context of coalitional games.