Mechanism Design for Scheduling with Uncertain Execution Time.

Date

2014-06-21

Advisors

Journal Title

Journal ISSN

ISSN

DOI

Volume Title

Publisher

AAAI Publications

Type

Conference

Peer reviewed

Yes

Abstract

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 time 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. We study different variations of the Vickrey mechanism that take as input the agents' reported distributions and the players' realized running times and that output a schedule that minimizes the expected sum of processing times, as well as payments that make it an ex-post equilibrium for the agents to both truthfully report their distributions and exert full effort to complete the task. We devise the ChPE mechanism, which is uniquely tailored to our problem, and has many desirable properties including: not rewarding agents that fail to finish the task and having non-negative payments.

Description

Keywords

mechanism design, scheduling, monotone hazard rate distribution, Vickrey mechanism, ex-post truthful, execution uncertainty

Citation

Conitzer, V. and Vidalli, A. (2014) Mechanism Design for Scheduling with Uncertain Execution Time. AAAI Conference on Artificial Intelligence, North America,

Rights

Research Institute