LinMatch recasts linear matching bandits as maximum-weight matching LPs solvable by the Hungarian algorithm and proves tight regret bounds of tilde Theta(d sqrt(MKT)).
Jessie and Ghaffari, Maani and Barton, Kira , title = "
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teaming
LinMatch recasts linear matching bandits as maximum-weight matching LPs solvable by the Hungarian algorithm and proves tight regret bounds of tilde Theta(d sqrt(MKT)).