Obserwuj
Orestis Papadigenopoulos
Orestis Papadigenopoulos
Inne imiona/nazwiskaVasileios Orestis Papadigenopoulos
Postdoctoral Research Scientist, Columbia University
Zweryfikowany adres z columbia.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Contextual blocking bandits
S Basu, O Papadigenopoulos, C Caramanis, S Shakkottai
International Conference on Artificial Intelligence and Statistics, 271-279, 2021
272021
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
232022
Combinatorial blocking bandits with stochastic delays
A Atsidakou, O Papadigenopoulos, S Basu, C Caramanis, S Shakkottai
International Conference on Machine Learning, 404-413, 2021
162021
Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits
O Papadigenopoulos, C Caramanis
Advances in Neural Information Processing Systems 34, 2021
12*2021
Scheduling MapReduce jobs under multi-round precedences
D Fotakis, I Milis, O Papadigenopoulos, V Vassalos, G Zois
European Conference on Parallel Processing, 209-222, 2016
72016
Scheduling mapreduce jobs and data shuffle on unrelated processors
D Fotakis, I Milis, O Papadigenopoulos, E Zampetakis, G Zois
International Symposium on Experimental Algorithms, 137-150, 2015
72015
Malleable scheduling beyond identical machines
D Fotakis, J Matuschke, O Papadigenopoulos
APPROX-RANDOM 2019, 2019
62019
Asymptotically-optimal gaussian bandits with side observations
A Atsidakou, O Papadigenopoulos, C Caramanis, S Sanghavi, ...
International Conference on Machine Learning, 1057-1077, 2022
52022
Single-Sample Prophet Inequalities Revisited
C Caramanis, M Faw, O Papadigenopoulos, E Pountourakis
arXiv preprint arXiv:2103.13089, 2021
52021
Scheduling mapreduce jobs on identical and unrelated processors
D Fotakis, I Milis, O Papadigenopoulos, V Vassalos, G Zois
Theory of Computing Systems 64, 754-782, 2020
52020
Assigning and scheduling generalized malleable jobs under subadditive or submodular processing speeds
D Fotakis, J Matuschke, O Papadigenopoulos
Operations Research, 2024
3*2024
Malleable scheduling beyond identical machines
D Fotakis, J Matuschke, O Papadigenopoulos
Journal of Scheduling 26 (5), 425-442, 2023
32023
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
32022
Contextual pandora’s box
A Atsidakou, C Caramanis, E Gergatsouli, O Papadigenopoulos, ...
Proceedings of the AAAI Conference on Artificial Intelligence 38 (10), 10944 …, 2024
22024
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
2*2022
Electric vehicle valet
A Khodabakhsh, O Papadigenopoulos, J Matuschke, J Horn, E Nikolova, ...
arXiv preprint arXiv:1811.06184, 2018
22018
MNL-prophet: Sequential assortment selection under uncertainty
V Goyal, S Humair, O Papadigenopoulos, A Zeevi
arXiv preprint arXiv:2308.05207, 2023
12023
Last switch dependent bandits with monotone payoff functions
A Foussoul, V Goyal, O Papadigenopoulos, A Zeevi
International Conference on Machine Learning, 10265-10284, 2023
12023
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
12022
A Constant-Factor Approximation for Generalized Malleable Scheduling under M</SUP>#<//SUP>-Concave Processing Speeds
D Fotakis, J Matuschke, O Papadigenopoulos
Mathematical Programming, 0
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20