activity
20162025
most citedCombinatorial Blocking Bandits with Stochastic Delays

3 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2025

Asymptotically-Optimal Gaussian Bandits with Side Observations

Alexia Atsidakou, Orestis Papadigenopoulos, Constantine Caramanis +2

We study the problem of Gaussian bandits with general side information, as first introduced by Wu, Szepesvari, and Gyorgy. In this setting, the play of an arm reveals information a…

cs.LG2023

Last Switch Dependent Bandits with Monotone Payoff Functions

Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos +1

In a recent work, Laforgue et al. introduce the model of last switch dependent (LSD) bandits, in an attempt to capture nonstationary phenomena induced by the interaction between th…

cs.LG20213 cited

Combinatorial Blocking Bandits with Stochastic Delays

Alexia Atsidakou, Orestis Papadigenopoulos, Soumya Basu +2

Recent work has considered natural variations of the multi-armed bandit problem, where the reward distribution of each arm is a special function of the time passed since its last p…

cs.LG20212 cited

Recurrent Submodular Welfare and Matroid Blocking Bandits

Orestis Papadigenopoulos, Constantine Caramanis

A recent line of research focuses on the study of the stochastic multi-armed bandits problem (MAB), in the case where temporal correlations of specific structure are imposed betwee…

cs.LG2020

Contextual Blocking Bandits

Soumya Basu, Orestis Papadigenopoulos, Constantine Caramanis +1

We study a novel variant of the multi-armed bandit problem, where at each time step, the player observes an independently sampled context that determines the arms' mean rewards. Ho…