Skip to main content

Mechanism design for scheduling with uncertain execution time

Publication ,  Conference
Conitzer, V; Vidali, A
Published in: Proceedings of the National Conference on Artificial Intelligence
January 1, 2014

We study the problem where a task (or multiple unrelated tasks) must be executed, there are multiple machines/agents that can potentially perform the task, and our objective is to minimize the expected sum of the agents' processing times. Each agent does not know exactly how long it will take him to finish the task; he only knows the distribution from which this lime is drawn. These times are independent across agents and the distributions fulfill the monotone hazard rate condition. Agents are selfish and will lie about their distributions if this increases their expected utility.

Duke Scholars

Published In

Proceedings of the National Conference on Artificial Intelligence

ISBN

9781577356776

Publication Date

January 1, 2014

Volume

1

Start / End Page

623 / 629
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Conitzer, V., & Vidali, A. (2014). Mechanism design for scheduling with uncertain execution time. In Proceedings of the National Conference on Artificial Intelligence (Vol. 1, pp. 623–629).
Conitzer, V., and A. Vidali. “Mechanism design for scheduling with uncertain execution time.” In Proceedings of the National Conference on Artificial Intelligence, 1:623–29, 2014.
Conitzer V, Vidali A. Mechanism design for scheduling with uncertain execution time. In: Proceedings of the National Conference on Artificial Intelligence. 2014. p. 623–9.
Conitzer, V., and A. Vidali. “Mechanism design for scheduling with uncertain execution time.” Proceedings of the National Conference on Artificial Intelligence, vol. 1, 2014, pp. 623–29.
Conitzer V, Vidali A. Mechanism design for scheduling with uncertain execution time. Proceedings of the National Conference on Artificial Intelligence. 2014. p. 623–629.

Published In

Proceedings of the National Conference on Artificial Intelligence

ISBN

9781577356776

Publication Date

January 1, 2014

Volume

1

Start / End Page

623 / 629