Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games
From MaRDI portal
Publication:5126630
DOI10.1287/opre.2019.1853zbMath1455.91015arXiv1704.02657OpenAlexW2809072130WikidataQ127928149 ScholiaQ127928149MaRDI QIDQ5126630
Thomas F. Lidbetter, Daniel Pirutinsky, Lisa Hellerstein
Publication date: 20 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.02657
Related Items
Network Inspection for Detecting Strategic Attacks, Exact and Approximation Algorithms for the Expanding Search Problem, A normal form game model of search and pursuit, A game theoretic approach to a problem in polymatroid maximization, Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
Cites Work
- Unnamed Item
- Improved approximation algorithms for directed Steiner forest
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- The search value of a set
- The expanding search ratio of a graph
- Finding a hider by an unknown deadline
- Adaptive game playing using multiplicative weights
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- Search games on a network with travelling and search costs
- An iterative method of solving a game
- SEARCH GAMES: LITERATURE AND SURVEY
- Search Games with Multiple Hidden Objects
- On the Complexity of Approximating a Nash Equilibrium
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Search Games with Mobile and Immobile Hider
- Randomized metarounding
- Hide-and-Seek Games on a Network, Using Combinatorial Search Paths
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
- Algorithms for distributional and adversarial pipelined filter ordering problems
- Searching a Variable Speed Network
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
- A Periodic Optimal Search
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
