arXiv (All)
open access
Deterministic Stackelberg Strategies in Robotaxi Assignment Games
In autonomous mobility duopolies, platforms compete for riders based on vehicle proximity. A critical operational challenge---faced by an incumbent proactively defending against a market entrant---is how to dispatch fleets to minimize demand poached by a reactive competitor. We model this competitio
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
- Optimal Strategies in a Sequential Contest with Failures#1014294
- Product Design in Monopolistic Competition#212595
- ANO: Robust Policy Optimization via Bounded, Redescending Gain Fields#1062899
- The lattice structure of the crawler#1217831
- A Comprehensive Nash Equilibrium Framework to Model Water Distribution Networks with Variable Speed Pumps#126753
Record · ID 1199304
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