arxiv
PublishedJuly 27, 2026 at 4:00 AM
—neutral
A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teaming
Publisher summary· verbatim
arXiv:2606.29221v2 Announce Type: replace Abstract: We address the problem of online multi-human multi-robot matching through the lens of a linear matching bandit framework, where a learner assigns robots with unknown features from a fixed pool to distinct sets of human agents over multiple rounds.
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivPhotonic reservoir computing with complex networks4harxivXS-VLA: Coupling Coarse-grained Spatial Distillation with Latent Flow Matching for Lightweight Robotic Control4harxivAgentic Permissions Policy Algebra for Taint Confinement in LLM Agents4harxivBeyond Squared Error: Exploring Loss Design for Enhanced Training of Generative Flow Networks4hThe Bubble Brief
WEEKLYRead machine-learning insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗