Does the Multisecretary Problem Always Have Bounded Regret?

Published in: CoRR (2019)

Keyphrases

online learning
lower bound
loss function
expert advice
real time
asymptotically optimal
learning algorithm
artificial intelligence
multiscale
multi agent
probability distribution
binary classification
weighted majority
bandit problems
regret minimization