arXiv (All)
open access
Strategyproof Mechanisms for Connecting Impassable Regions
We study strategyproof mechanisms for building a pathway between two regions of a line segment separated by an obstacle. Each of the $n$ agents has a private location within its region and may use either its original route to a facility or the new pathway, whose traversal cost is a fraction $k\in[0,
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
- StateFork: Branchable Infrastructure for Agent Exploration#1169656
- StateFork: Branchable Infrastructure for Agent Exploration#1143249
- Fair Division of Graphs: Beyond Traceability#799152
- Fair Division of Graphs: Beyond Traceability#797729
- Decomposition Buys Integrity, Not Yield#1123825
Record · ID 985839
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