The search value of a set

DOI10.1007/S10479-016-2252-YMaRDI QIDQ1699127zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ken Kikuta, Robbert Fokkink, David Mark Ramsey

Publication date 16 February 2018

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10479-016-2252-y

zbMATH Keywords

coalitional gamesearch gamesubmodular functionzero-sum game

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• A search game with a non-additive cost
• scientific article; zbMATH DE number 18884
• Manhunting -- a simple search game
• A HIDE AND SEEK GAME WITH TRAVELING COST
• Search games for an immobile hider

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Decomposition of submodular functions
• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Mining coal or finding terrorists: the expanding search paradigm
• Search Games with Mobile and Immobile Hider
• Search games with multiple hidden objects
• Search Theory
• Submodular functions and optimization.
• The assignment game. I: The core
• The search value of a network
• The theory of search games and rendezvous.

Cited in

(4)

• Approximate solutions for expanding search games on general networks
• A search game with a non-additive cost
• A General Framework for Approximating Min Sum Ordering Problems
• Solving zero-sum games using best-response oracles with applications to search games

This page was built for publication: The search value of a set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699127)