The search value of a set

Title

The search value of a set

 Author

Fokkink, R.J. (TU Delft Applied Probability) ORCID 0000-0001-8347-4110
Kikuta, Ken (University of Hyogo)
Ramsey, David (Wrocław University of Technology)

Date

2017-09-01

 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.


 Subject

Coalitional game
Search game
Submodular function
Zero-sum game

 To reference this document use:

http://resolver.tudelft.nl/uuid:fca9f818-df77-4300-b530-001fbc936b17

 DOI

https://doi.org/10.1007/s10479-016-2252-y

 ISSN

0254-5330

 Source

Annals of Operations Research, 256 (1), 63-73

 Part of collection

Institutional Repository

 Document type

journal article

 Rights

© 2017 R.J. Fokkink, Ken Kikuta, David Ramsey
Files
PDF 10.1007_s10479_016_2252_y.pdf 577.25 KB
Close viewer