Researchers have developed a new set-based dynamic programming approach to analyze discrete, simultaneous-move pursuit-evasion games on graphs. This method provides necessary and sufficient conditions for pursuer victory, unlike previous geometric approaches that offered only sufficient conditions and relied on open-loop strategies. The analysis also allows for the translation of dominance sets into real-time feedback strategies. For scenarios where neither player can guarantee a win, the work introduces an instantaneous matrix-game formulation to establish bounds on the pursuer's winning probability, with simulation results validating the approach. AI
RANK_REASON This is a research paper published on arXiv detailing a new analytical method for game theory. [lever_c_demoted from research: ic=1 ai=0.4]
Read on arXiv cs.MA (Multiagent) →
- alphaXiv
- arXiv
- arXivLabs
- CatalyzeX Code Finder for Papers
- computer science
- CORE Recommender
- DagsHub
- Feedback Dominance Analysis for Pursuit-Evasion Games on Graphs
- game theory
- Gotit.pub
- Hugging Face
- Influence Flower
- Pursuit-evasion games: a tractable framework for antijamming games in aerial attacks
- ScienceCast
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →