25 citations · 46 across the 15 of their papers we have counts for
16 papers
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…
MNL-Prophet: Sequential Assortment Selection under Uncertainty
Vineet Goyal, Salal Humair, Orestis Papadigenopoulos +1
Due to numerous applications in retail and (online) advertising the problem of assortment selection has been widely studied under many combinations of discrete choice models and fe…
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…
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret
Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai
The stochastic multi-armed bandit setting has been recently studied in the non-stationary regime, where the mean payoff of each action is a non-decreasing function of the number of…
Contextual Pandora's Box
Alexia Atsidakou, Constantine Caramanis, Evangelia Gergatsouli +2
Pandora's Box is a fundamental stochastic optimization problem, where the decision-maker must find a good alternative while minimizing the search cost of exploring the value of eac…
A Constant-Factor Approximation for Generalized Malleable Scheduling under -Concave Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
In generalized malleable scheduling, jobs can be allocated and processed simultaneously on multiple machines so as to reduce the overall makespan of the schedule. The required proc…