Stochastic Matching Bandits with Rare Optimization Updates
We introduce a bandit framework for stochastic matching under the multinomial logit (MNL) choice model. In this setting, $N$ agents on one side are assigned to $K$ arms on the other side, where each arm stochastically selects an agent from its assigned pool according to unknown preferences and…
By Jung-hun Kim, Min-hwan OharXiv - stat.ML
Read the full story
Originally published by arXiv - stat.ML on Oct 23, 2026.
Comments
Sign in to join the discussion.