Answers are grounded in this paper and cite their sources.
In a multi-armed bandit (MAB) problem, an online algorithm makes a sequence of choices. In each round it chooses from a time-invariant set of alternatives and receives the payoff associated with th...
No takes yet. Share an insight, caveat, or question.
SlivkinsAleksandrs (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: