Articles with public access mandates - Orestis PapadigenopoulosLearn more
Available somewhere: 9
Single-sample prophet inequalities via greedy-ordered selection
C Caramanis, P Dütting, M Faw, F Fusco, P Lazos, S Leonardi, ...
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Mandates: US National Science Foundation, European Commission, Government of Italy
Contextual blocking bandits
S Basu, O Papadigenopoulos, C Caramanis, S Shakkottai
International Conference on Artificial Intelligence and Statistics, 271-279, 2021
Mandates: US National Science Foundation, US Department of Defense
Combinatorial blocking bandits with stochastic delays
A Atsidakou, O Papadigenopoulos, S Basu, C Caramanis, S Shakkottai
International Conference on Machine Learning, 404-413, 2021
Mandates: US National Science Foundation, US Department of Defense
Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits
O Papadigenopoulos, C Caramanis
Advances in Neural Information Processing Systems 34, 2021
Mandates: US National Science Foundation, US Department of Defense
Asymptotically-optimal Gaussian bandits with side observations
A Atsidakou, O Papadigenopoulos, C Caramanis, S Sanghavi, ...
International Conference on Machine Learning, 1057-1077, 2022
Mandates: US National Science Foundation
Assigning and scheduling generalized malleable jobs under subadditive or submodular processing speeds
D Fotakis, J Matuschke, O Papadigenopoulos
Operations Research, 2024
Mandates: US National Science Foundation, Research Foundation (Flanders)
Non-stationary bandits under recharging payoffs: Improved planning with sublinear regret
O Papadigenopoulos, C Caramanis, S Shakkottai
Advances in Neural Information Processing Systems 35, 20325-20337, 2022
Mandates: US National Science Foundation
Learning to maximize welfare with a reusable resource
M Faw, O Papadigenopoulos, C Caramanis, S Shakkottai
Proceedings of the ACM on Measurement and Analysis of Computing Systems 6 (2 …, 2022
Mandates: US National Science Foundation, US Department of Defense
A Constant-Factor Approximation for Generalized Malleable Scheduling Under M ♮-Concave Processing Speeds
D Fotakis, J Matuschke, O Papadigenopoulos
Integer Programming and Combinatorial Optimization: 23rd International …, 2022
Mandates: US National Science Foundation, Research Foundation (Flanders)
Publication and funding information is determined automatically by a computer program