Cited in
(45)- A theoretical and empirical investigation of search in imperfect information games
- A general framework for searching on a line
- 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
- Linear search by a pair of distinct-speed robots
- Finding a hider by an unknown deadline
- Search on a line with faulty robots
- Tree optimization based heuristics and metaheuristics in network construction problems
- Search for a moving target in a competitive environment
- Weighted group search on a line \& implications to the priority evacuation problem
- A symbolic programming approach to the rendezvous search problem
- Time-critical testing and search problems
- Priority evacuation from a disk: the case of \(n = 1,2,3\)
- Deterministic rendezvous with different maps
- Search for an immobile hider in a known subset of a network
- Optimal discrete search with technological choice
- Search theory, competitive equilibrium, and the Nash bargaining solution
- Finding a moving fugitive. A game theoretic representation of search
- Searching on a line: a complete characterization of the optimal solution
- A theory of search with deadlines and uncertain recall
- A general framework for searching on a line
- scientific article; zbMATH DE number 4132081 (Why is no real title available?)
- Limits of some combinatorial problems
- A search game taking account of attributes of searching resources
- scientific article; zbMATH DE number 5578194 (Why is no real title available?)
- ON THE GAME‐THEORETIC FOUNDATIONS OF COMPETITIVE SEARCH EQUILIBRIUM*
- Game Theoretical Approach for Reliable Enhanced Indexation
- Ambush and active search in multistage predator-prey interactions
- A random walk perspective on hide-and-seek games
- Exact and Approximation Algorithms for the Expanding Search Problem
- Improved Lower Bounds for Shoreline Search
- scientific article; zbMATH DE number 7271257 (Why is no real title available?)
- 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)
- Caching and accumulation games
- Triangle evacuation of 2 agents in the wireless model \& the power of choosing a starting point
- Weighted group search on the disk \& improved lower bounds for priority evacuation
- Weighted group search on the disk and improved LP-based lower bounds for priority evacuation
- Blotto game with testing (the locks, bombs and testing model)
- Attack-defense game model with testing
- Strategic hiding and exploration in networks
- Searching for a mobile hider in a directed bipartite graph
- Introduction to search theory and applications
This page was built for publication: Search Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4914941)
