6 citations · 8 across the 4 of their papers we have counts for
4 papers
Complexity Analysis of a Countable-armed Bandit Problem
Anand Kalvit, Assaf Zeevi
We consider a stochastic multi-armed bandit (MAB) problem motivated by ``large'' action spaces, and endowed with a population of arms containing exactly arm-types, each charact…
Bandits with Dynamic Arm-acquisition Costs
Anand Kalvit, Assaf Zeevi
We consider a bandit problem where at any time, the decision maker can add new arms to her consideration set. A new arm is queried at a cost from an "arm-reservoir" containing fini…
A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms
Anand Kalvit, Assaf Zeevi
One of the key drivers of complexity in the classical (stochastic) multi-armed bandit (MAB) problem is the difference between mean rewards in the top two arms, also known as the in…
From Finite to Countable-Armed Bandits
Anand Kalvit, Assaf Zeevi
We consider a stochastic bandit problem with countably many arms that belong to a finite set of types, each characterized by a unique mean reward. In addition, there is a fixed dis…