scientific article; zbMATH DE number 4116343

MaRDI QIDQ4731030zbMATH OpenFDO

Authors M. A. Aramendia, Edward J. Anderson

Publication date 1989

zbMATH Keywords

search game on a network

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Multistage and repeated games (91A20)

Recommendations

• The search game on a network with immobile hider
• Network search games, with arbitrary searcher starting point
• Search games on networks with travelling and search costs and with arbitrary searcher starting points
• Approximate solutions for expanding search games on general networks
• An algorithm for finding Nash equilibria in dynamic network games
• scientific article; zbMATH DE number 2094482
• A generalization of the multi-stage search allocation game
• A new approach to Gal's theory of search games on weakly Eulerian networks
• Hide-and-seek games on a network, using combinatorial search paths

Cited in

(3)

• Network search games, with arbitrary searcher starting point
• A Linear Programming Approach to the Search Game on a Network with Mobile Hider
• Game Theoretical Approach for Reliable Enhanced Indexation

This page was built for publication:

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