Multinomial Subset Routing with Sum-Max Rewards and Operational Constraints.

arXiv:2608.16375v2 Announce Type: replace-cross Abstract: We study online routing to subsets of experts under aggregate bandit feedback and long-run operational constraints. Expert contributions can be complementary: for each task dimension, the best selected