AI Chat AI Image Generator AI Video Text to Speech

Prompt Scheduling for Selfish Agents

04/09/2018

∙

by Alon Eden, et al.

∙

∙

We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic agents, delaying scheduling decisions makes little sense. Moreover, the mechanism has a particularly simple form of an anonymous menu of options.

Alon Eden
13 publications
Michal Feldman
38 publications
Amos Fiat
10 publications
Tzahi Taub
1 publication

page 1

page 2

page 3

page 4

research

∙ 11/26/2019

Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times

The paper considers single-machine scheduling problems with a non-renewa...

0 Kristóf Bérczi, et al. ∙

research

∙ 11/03/2022

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling

We study kill-and-restart and preemptive strategies for the fundamental ...

0 Sven Jäger, et al. ∙

research

∙ 03/02/2022

Truthful Online Scheduling of Cloud Workloads under Uncertainty

Cloud computing customers often submit repeating jobs and computation pi...

0 Moshe Babaioff, et al. ∙

research

∙ 04/17/2019

Terra: Scalable Cross-Layer GDA Optimizations

Geo-distributed analytics (GDA) frameworks transfer large datasets over ...

0 Jie You, et al. ∙

research

∙ 09/10/2019

Well-behaved Online Load Balancing Against Strategic Jobs

In the online load balancing problem on related machines, we have a set ...

0 Bo Li, et al. ∙

research

∙ 03/30/2023

Weighted Scheduling of Time-Sensitive Coflows

Datacenter networks routinely support the data transfers of distributed ...

0 Olivier Brun, et al. ∙

research

∙ 07/30/2019

Open shop scheduling games

This paper takes a game theoretical approach to open shop scheduling pro...

0 Ata Atay, et al. ∙