Weighted search games

DOI10.1016/j.ejor.2008.02.007zbMath1159.91008MaRDI QIDQ2378340

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

Publication date: 8 January 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.02.007

zbMATH Keywords

game theory; group decisions and negotiations; search theory; two-person zero-sum game; inspection game

Mathematics Subject Classification ID

91A10: Noncooperative games

90B40: Search theory

91A24: Positional games (pursuit and evasion, etc.)

Related Items

Optimal search and ambush for a hider who can escape the search region, Ambush and active search in multistage predator-prey interactions, A foraging problem: sit-and-wait versus active predation, Patrolling a perimeter, Weighted network search games with multiple hidden objects and multiple search teams, Search-and-rescue rendezvous, New types of winning strategies via compact spaces, A SEARCHER VERSUS HIDER GAME WITH INCOMPLETE INFORMATION ABOUT SEARCH RESOURCES, Tools to Manage Search Games on Lattices, The Cardinality of the Sets Involved in Lattice Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infiltration games on arbitrary graphs
• On the infiltration game
• The theory of search games and rendezvous.
• Search games and other applications of game theory
• The nonlinear knapsack problem - algorithms and applications
• Raid games across a set with cyclic order
• The Upper Risk of an Inspection Agreement
• Efficient distributions of arms‐control inspection effort
• A fast infiltration game onn arcs
• Some games of search on a lattice
• A generalized inspection game