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