Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources
arXiv:2610.19038v1 Announce Type: new Abstract: 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 im…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-10-15 04:00 · arXiv cs.LG
Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources