A new approach to Gal's theory of search games on weakly Eulerian networks
From MaRDI portal
Publication:692087
DOI10.1007/S13235-011-0009-4zbMATH Open1252.91023OpenAlexW2085534689MaRDI QIDQ692087FDOQ692087
Authors: Steve Alpern 
Publication date: 4 December 2012
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13235-011-0009-4
Recommendations
- A game theoretic approach to the analysis of dynamic networks
- scientific article; zbMATH DE number 2081020
- A game-theoretic approach to network equilibrium
- Approximate solutions for expanding search games on general networks
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
- Equilibrium refinements for the network formation game
- Vertex Pursuit Games in Stochastic Network Models
- An algorithm for finding Nash equilibria in dynamic network games
- Experimental games on networks: underpinnings of behavior and equilibrium selection
- Equilibria and efficiency loss in games on networks
Cites Work
- The theory of search games and rendezvous.
- Find-and-fetch search on a tree
- Search Games with Mobile and Immobile Hider
- Search games
- Search games and other applications of game theory
- On Some Differential Games
- Initial point search on weighted trees
- Network search games, with arbitrary searcher starting point
- On the optimality of a simple strategy for searching graphs
- Search games with immobile hider
- Search games on trees with asymmetric travel times
- A Mixed-Strategy Minimax Theorem without Compactness
- A search game on the union of graphs with immobile hider
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- Alternating search at two locations
Cited In (11)
- Hide-and-seek games on a network, using combinatorial search paths
- Title not available (Why is that?)
- Search for an immobile hider in a known subset of a network
- On the optimality of a simple strategy for searching graphs
- Social distancing, gathering, search games: mobile agents on simple networks
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Hide-and-seek games on a tree to which Eulerian networks are attached
- Approximate solutions for expanding search games on general networks
- Search and delivery man problems: when are depth-first paths optimal?
- On the approximation ratio of the random Chinese postman tour for network search
- Optimal trade-off between speed and acuity when searching for a small object
This page was built for publication: A new approach to Gal's theory of search games on weakly Eulerian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692087)
