arXiv (All)
open access
Tight Guarantees for Static Policies in Vehicle Sharing Networks
We study pricing in a vehicle sharing network with $N$ locations and $C$ vehicles, motivated by on-demand bike, scooter, and car sharing, as well as robotaxi and ride sharing services. Customers request directed trips between locations, with travel times following general distributions, and leave wi
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
- Polynomial Algorithms for Simultaneous Share-Based and Envy-Based Guarantees#1326687
- Congestion-dependent pricing for a service provider#264936
- Minimizing Cumulative Envy in Allocating a Sequence of Items#1234210
- Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models#1247466
- The Power of Simple Mechanisms: A Tight $e$-Approximation for Gains from Trade in Matching Markets#1142298
Record · ID 1297441
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