The theory of search games and rendezvous.
From MaRDI portal
Publication:1416614
zbMath1034.91017MaRDI QIDQ1416614
Publication date: 15 December 2003
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
Differential games and control (49N70) Search theory (90B40) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (only showing first 100 items - show all)
Linear Search with Terrain-Dependent Speeds ⋮ Technical note: Find a hidden “treasure” ⋮ Querying with Uncertainty ⋮ Searching for a Non-adversarial, Uncooperative Agent on a Cycle ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Edge Search Number of Cographs in Linear Time ⋮ Search games on networks with travelling and search costs and with arbitrary searcher starting points ⋮ Improved Lower Bounds for Shoreline Search ⋮ Almost universal anonymous rendezvous in the plane ⋮ Best-of-both-worlds analysis of online search ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Connected search for a lazy robber ⋮ A nearly optimal randomized algorithm for explorable heap selection ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ The search and rescue game on a cycle ⋮ Triangle evacuation of 2 agents in the wireless model (extended abstract) ⋮ On Submodular Search and Machine Scheduling ⋮ Search on a Line by Byzantine Robots ⋮ Mixed Search Number of Permutation Graphs ⋮ Weighted online search ⋮ Mixed Search Number and Linear-Width of Interval and Split Graphs ⋮ Overcoming probabilistic faults in disoriented linear search ⋮ Collaborative dispersion by silent robots ⋮ Optimal circle search despite the presence of faulty robots ⋮ Ten Open Problems in Rendezvous Search ⋮ A Discrete Search-Ambush Game with a Silent Predator ⋮ Unnamed Item ⋮ Delivery to safety with two cooperating robots ⋮ Algorithms for \(p\)-Faulty Search on a half-line ⋮ Online search with a hint ⋮ Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Zero-Sum Two Person Games ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ Rendezvous Search with Revealed Information: Applications to the Line ⋮ Mobile Agent Rendezvous in a Ring Using Faulty Tokens ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Gathering in dynamic rings ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ A Jamming Game in Wireless Networks with Transmission Cost ⋮ A cooperative game in search theory ⋮ Byzantine fault tolerant symmetric-persistent circle evacuation ⋮ Near-gathering of energy-constrained mobile agents ⋮ Time-energy tradeoffs for evacuation by two robots in the wireless model ⋮ Byzantine fault tolerant symmetric-persistent circle evacuation ⋮ Delay-Predictability Trade-offs in Reaching a Secret Goal ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Competitive Searching for a Line on a Line Arrangement. ⋮ Energy Consumption of Group Search on a Line ⋮ An Asymptotic Solution of Dresher’s Guessing Game ⋮ Unnamed Item ⋮ Black Hole Search in Directed Graphs ⋮ Searching a Variable Speed Network ⋮ On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread ⋮ A symbolic programming approach to the rendezvous search problem ⋮ Byzantine gathering in networks ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ On asynchronous rendezvous in general graphs ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Infrastructure security games ⋮ Rendezvous in networks in spite of delay faults ⋮ Further connections between contract-scheduling and ray-searching problems ⋮ Weighted search games ⋮ Byzantine gathering in polynomial time ⋮ Optimal search and ambush for a hider who can escape the search region ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Collision-free network exploration ⋮ Multi-processor search and scheduling problems with setup cost ⋮ A search game on a hypergraph with booby traps ⋮ A general framework for searching on a line ⋮ Patrolling a perimeter ⋮ Operations research applications of dichotomous search ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Pebble guided optimal treasure hunt in anonymous graphs ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Search and rescue in the face of uncertain threats ⋮ Competitive search in a network ⋮ A Caching Game with Infinitely Divisible Hidden Material ⋮ Codes, lower bounds, and phase transitions in the symmetric rendezvous problem ⋮ A foraging problem: sit-and-wait versus active predation ⋮ The beachcombers' problem: walking and searching with mobile robots ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ Mapping simple polygons: how robots benefit from looking back ⋮ Edge search number of cographs ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Edge degeneracy: algorithmic and structural results ⋮ Interruptible algorithms for multiproblem solving ⋮ Search Games: A Review ⋮ Search Games for an Immobile Hider ⋮ Tools to Manage Search Games on Lattices ⋮ Some Cinderella Ruckle Type Games ⋮ Rendezvous Problem
This page was built for publication: The theory of search games and rendezvous.
