Static search games played over graphs and general metric spaces
From MaRDI portal
Publication:2356189
DOI10.1016/j.ejor.2013.06.024zbMath1317.91006OpenAlexW2007806054MaRDI QIDQ2356189
Thomas P. Oléron Evans, Steven R. Bishop
Publication date: 29 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.024
Related Items (5)
New inequalities for network distance measures by using graph spectra ⋮ Optimal search and ambush for a hider who can escape the search region ⋮ The price of defense ⋮ Continuous patrolling and hiding games ⋮ On conjectures of network distance measures by using graph spectra
Uses Software
Cites Work
- Pure strategy Nash equilibria in non-zero sum Colonel Blotto games
- Rendezvous search on a star graph with examination costs
- Search game in a rectangle
- A network game with attackers and a defender
- Network search games with immobile hider, without a designated searcher starting point
- Two point one sided rendezvous
- Sequential, nonzero-sum ``Blotto: allocating defensive resources prior to attack
- Search-hide games on trees
- A remark on the Princess and Monster search game
- Infiltration games on arbitrary graphs
- Accumulation games. I: Noisy search
- Fugitive-search games on graphs and related parameters
- A search game when a search path is given
- Asymmetric rendezvous search on the circle
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- A generalization of Ruckle's results for an ambush game
- The gold-mine game
- Raid games across a set with cyclic order
- Simple search games on an infinite circular cylinder
- Patrolling a perimeter
- A game related to the number of hides game
- Search games with immobile hider
- Finding a moving fugitive. A game theoretic representation of search
- The Colonel Blotto game
- New results on a Ruckle problem in discrete games of ambush
- Patrolling Games
- Searching symmetric networks with Utilitarian-Postman paths
- Protecting complex infrastructures against multiple strategic attackers
- On Ruckle's Conjecture on Accumulation Games
- Search Games on Trees with Asymmetric Travel Times
- Network search games, with arbitrary searcher starting point
- Hide-and-seek games on a tree to which Eulerian networks are attached
- Security and Game Theory
- The search game on a network with immobile hider
- Discrete search allocation game with false contacts
- A search game taking account of attributes of searching resources
- Rendez-vous search on a rectangular lattice
- Essentials of Game Theory: A Concise Multidisciplinary Introduction
- Admissibility in Infinite Games
- A cooperative game in search theory
- The “Princess and Monster” Game on an Interval
- Searching for an Agent Who May OR May Not Want to be Found
- Rendezvous Search: A Personal Perspective
- A High–Low search game on the unit interval
- The search value of a network
- Search for point in interval, with high–low feedback
- Ambush Strategies in Search Games on Graphs
- The Number Hides Game
- Systems defense games: Colonel blotto, command and control
- A hide–search game
- Cumulative search-evasion games
- Dynamic Search Games
- Iterated Elimination of Dominated Strategies in a Bertrand-Edgeworth Model
- A Linear Programming Approach to the Search Game on a Network with Mobile Hider
- A Discrete Search Game
- A Stochastic Search Game
- Search Games with Mobile and Immobile Hider
- Differential Search Games with Mobile Hider
- Rendezvous search on a graph
- Initial point search on weighted trees
- The Symmetric Rendezvous-Evasion Game
- Continuous accumulation games on discrete locations
- A search game on a cyclic graph
- Minimax Rendezvous on the Line
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- A search game on the union of graphs with immobile hider
- A search game with a protector
- Some games of search on a lattice
- Rendezvous on a Planar Lattice
- Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance
- An attack‐defense game with matrix strategies
- A Multistage Search Game
- On the Cookie-Cutter Game: Search and Evasion on a Disc
- Continuous accumulation games in continuous regions
- Alternating search at two locations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Static search games played over graphs and general metric spaces
