SPIN Unprocessed October 15, 2026 ai_technology research
Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources
View original on arxiv.orgOverview
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 immediately assigned to servers that become temporarily busy, yielding rewards that depend on the task-server pair. The goal is to maximize long-run average reward. We cast the problem as a contextual re
SpinGraph analysis pending — check back after processing.
Ask AI about this story
Opens with the SpinGraph .md URL and structured context — one click, prompt included.
More from arXiv Machine Learning
View all →- Backpropagating Verifier Rewards Through Continuous Flow Language Models
- Theoretical and Practical Advances in Hierarchical Bayesian Deep Learning Methodology
- How Inner Optimizers Shape Replica Scaling
- Deep Generative Models for Phylogenetic Inference with Complex Evolutionary Processes
- What Information Buys in Active Inference
- Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT
Markdown (.md) · JSON-LD schema (.json) · Machine-readable for AI & GEO