The search value of a set

DOI10.1007/s10479-016-2252-yzbMath1415.91068OpenAlexW2472216798WikidataQ59606388 ScholiaQ59606388MaRDI QIDQ1699127

Ken Kikuta, Robbert J. Fokkink, David M. Ramsey

Publication date: 16 February 2018

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

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

zbMATH Keywords

submodular functionzero-sum gamecoalitional gamesearch game

Mathematics Subject Classification ID

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

Related Items (3)

A General Framework for Approximating Min Sum Ordering Problems ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Approximate solutions for expanding search games on general networks

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition of submodular functions
• The theory of search games and rendezvous.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The assignment game. I: The core
• Submodular functions and optimization.
• Search Games with Multiple Hidden Objects
• The search value of a network
• Search Games with Mobile and Immobile Hider
• Search Theory
• Mining Coal or Finding Terrorists: The Expanding Search Paradigm

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