Tools to manage search games on lattices

DOI10.1007/978-1-4614-6825-7_3MaRDI QIDQ2961392zbMATH OpenOpenAlexFDO

Authors Noemí Zoroa, María-José Fernández-Sáez, Procopio Zoroa

Publication date 20 February 2017

Published in Search Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-6825-7_3

Mathematics Subject Classification ID

Search theory (90B40) Structure theory of lattices (06B05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Some games of search on a lattice
• Weighted search games
• scientific article; zbMATH DE number 4059172
• Static search games played over graphs and general metric spaces
• Search games on a network with travelling and search costs

Cites work

• scientific article; zbMATH DE number 3823533 (Why is no real title available?)
• On the optimality of a simple strategy for searching graphs
• Patrolling a perimeter
• Patrolling games
• Raid games across a set with cyclic order
• Search Games with Mobile and Immobile Hider
• Search games
• Some games of search on a lattice
• The search value of a network
• The theory of search games and rendezvous.
• Weighted search games

Cited in

(6)

• scientific article; zbMATH DE number 4059172 (Why is no real title available?)
• Search for an immobile hider in a known subset of a network
• Weighted network search games with multiple hidden objects and multiple search teams
• Approximate solutions for expanding search games on general networks
• Some games of search on a lattice
• Weighted search games

This page was built for publication: Tools to manage search games on lattices

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