arXiv (All)
open access
Exact Locality Gaps for Matchable Semi-Matchings
An assignment of tasks to servers can resist every small improvement and still make tasks wait longer than necessary. We determine exactly how inefficient such an assignment can be when each task requires one unit of service and the eligibility constraints permit all tasks to use distinct servers. F
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
- Hardness of Sampling in Random Constraint Satisfaction Problems#350556
- Hierarchical Correctness Proofs for Distributed Algorithms#472207
- Running the Gauntlet: Hard Agentic Tasks#1129300
- Information Requirements for Service Allocation and Aggregate Verification#1084192
- Simultaneous Envy and Equitability Guarantees#1084340
Record · ID 1156919
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