4 papers
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…
Malleable scheduling beyond identical machines
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the processing time depending on the number of allocated machines. In this setting, jobs…
Electric Vehicle Valet
Ali Khodabakhsh, Orestis Papadigenopoulos, Jannik Matuschke +3
We propose a novel way to use Electric Vehicles (EVs) as dynamic mobile energy storage with the goal to support grid balancing during peak load times. EVs seeking parking in a busy…
Scheduling MapReduce Jobs under Multi-Round Precedences
Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos +2
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the ave…