arXiv (All)
open access
Feedback Dominance Analysis for Pursuit-Evasion Games on Graphs
This work identifies the dominance regions for discrete, simultaneous-move pursuit-evasion games on graphs. Existing geometric approaches provide efficient characterizations of winning regions, but typically provide only sufficient conditions and rely on open-loop strategies. To address these challe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Domination in graphs#1332110
- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825
- Co-design Gym: A Unified Benchmark for Embodiment-Policy Co-optimization#1186680
- Auction-Based Algorithms for Matroid Intersection: Near-Linear Query Complexity and Constant-Pass Semi-Streaming#1143286
- Characterization of Some Graphs Realizing Regularity Bounds for Binomial Edge Ideals#1143680
Record · ID 1202605
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive