Lag: A mean-field optimal policy for online assignment with reusable resources
Read the original at arxiv.org→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...
Original headline: "Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources"
Coverage timeline
- Oct 15, 04:00 UTC arXiv cs.LG lead source Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources