Scheduling without Payments

  title={Scheduling without Payments},
  author={Elias Koutsoupias},
We consider mechanisms without payments for the problem of scheduling unrelated machines. Specifically, we consider truthful in expectation randomized mechanisms under the assumption that a machine (player) is bound by its reports: when a machine lies and reports value t̃i j for a task instead of the actual one ti j , it will execute for time t̃i j if it gets the task (unless the declared value t̃i j is less than the actual value ti j , in which case, it will execute for time ti j ). Our main… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.

Similar Papers

Loading similar papers…