arXiv (All)
open access
Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources
We study online task assignment with reusable resources. This problem arises in peer reviewer assignment, skill-based call routing, rideshare matching, emergency dispatch, and crowdsourcing: Tasks arrive according to a geometric process and must be immediately assigned to servers that become tempora
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
- The Fixed Server Locality Gap of Count Load Assignment Games#1084434
- Online Fair Allocation with Best-of-Many-Worlds Guarantees#1216126
- An Introduction to Contract Theory for Computer Scientists#1342212
- Improved Analysis of Adaptive Task Allocation and Non-Stationary Processing Times#1343780
- Strategyproof Multi-Resource Allocation in Cloud Computing via Adaptive-Speed Fairness#1142335
Record · ID 1344861
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