arXiv (All)
open access
Stationary Online Contention Resolution Schemes: Theory and Applications to Bayesian Online Resource Allocation
Motivated by problems in Bayesian reusable resource allocation, we introduce the concept of stationary online contention resolution schemes (S-OCRSs). OCRSs are a central tool used to solve non-reusable resource allocation problems. They convert solutions to fluid approximations of problems into fea
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
- Improved Analysis of Adaptive Task Allocation and Non-Stationary Processing Times#1343780
- Russian roulette#1269038
- Fast and Scalable Multi-Agent Distribution Matching via Partitioned Optimal Transport#1143927
- A non-local macroscopic model for traffic flow#274329
- On the Naming and Binding of Network Destinations#158840
Record · ID 1232686
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