arXiv (All)
open access
Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals
Resource allocation systems often restrict each request to a short list of options before coordinating assignments globally. We study this separation in stochastic bipartite matching under independent vertex arrivals. Each request draws a state from its own known distribution, determining its compat
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
- Degree-Parameterized Analysis of Sampling-Based Online Matching#1083917
- Multiscale Renormalization of Weighted Networks#1142884
- Mixing Time of Conditional Two Star Exponential Random Graphs#1083783
- Random independent sets and local sparsity#927922
- Random-Priority Frontier Routing: Tight $Θ(n^c)$ Bounds Against $c$-Node Cartels#820895
Record · ID 1063372
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