Search Theory

DOI10.1007/978-1-4614-6825-7zbMath1263.91001OpenAlexW302937848MaRDI QIDQ4914941

No author found.

Publication date: 15 April 2013

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

Mathematics Subject Classification ID

Search theory (90B40) Applications of game theory (91A80) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (28)

A symbolic programming approach to the rendezvous search problem ⋮ A random walk perspective on hide-and-seek games ⋮ Limits of some combinatorial problems ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ A general framework for searching on a line ⋮ Improved Lower Bounds for Shoreline Search ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Triangle evacuation of 2 agents in the wireless model (extended abstract) ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ The search value of a set ⋮ Continuous patrolling and hiding games ⋮ A search problem on a bipartite network ⋮ Ambush and active search in multistage predator-prey interactions ⋮ Time-critical testing and search problems ⋮ Linear search by a pair of distinct-speed robots ⋮ Search on a line with faulty robots ⋮ Fast two-robot disk evacuation with wireless communication ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ Finding a hider by an unknown deadline ⋮ Priority evacuation from a disk: the case of \(n = 1,2,3\) ⋮ Searching on a line: a complete characterization of the optimal solution ⋮ A General Framework for Searching on a Line ⋮ Search for a moving target in a competitive environment ⋮ Unnamed Item ⋮ Deterministic rendezvous with different maps ⋮ Search for an immobile hider in a known subset of a network ⋮ Weighted group search on a line \& implications to the priority evacuation problem ⋮ Optimal discrete search with technological choice

This page was built for publication: Search Theory