arXiv (All)
open access
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
We study the performance of sequential contention resolution and matching algorithms on random graphs with vanishing edge probabilities. When the edges of the graph are processed in an adversarially-chosen order, we derive a new OCRS that is $0.382$-selectable, attaining the "independence benchmark"
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
- Recovery Theory for Projected Power Iterations in Permutation Synchronization#987243
- Optimal complete-feedback card guessing under nonincreasing valley weights: A proof of the Diaconis-Fulman-Holmes shelf-shuffling conjecture#1051556
- Consensus times for monotone aggregation dynamics#927756
- A Tale of Two Learning Algorithms: Multiple Stream Random Walk and Asynchronous Gossip#149258
- An $O(k\log(n/k))$ Bound on Spanning Bipartite Connectivity#1049006
Record · ID 1144694
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