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
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivRetrieval Augmented Generation Compositionality13hThe Bubble Brief
MON · WED · FRIRead machine-learning insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗