Optimal mechanisms for single machine scheduling

B. Heydenreich, D. Mishra, R. Müller, Marc Jochen Uetz

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)


We study the design of optimal mechanisms in a setting here job-agents compete for being processed by a service provider that can handle one job at a time. Each job has a processing time and incurs a waiting cost. Jobs need to be compensated for waiting. We consider two models, one where only the waiting costs of jobs are private information (1-d), and another where both waiting costs and processing times are private (2-d). An optimal mechanism minimizes the total expected expenses to compensate all jobs, while it has to be Bayes-Nash incentive compatible. We derive closed formulae for the optimal mechanism in the 1-d case and show that it is efficient for symmetric jobs. For nonsymmetric jobs, we show that efficient mechanisms perform arbitrarily bad. For the 2-d case, we prove that the optimal mechanism in general does not even satisfy IIA, the ‘independent of irrelevant alternatives’ condition. We also show that the optimal mechanism is not even efficient for symmetric agents in the 2-d case.
Original languageUndefined
Title of host publicationInternet And Network Economics (WINE 2008)
EditorsC. Papadimitriou, S. Zhang
Place of PublicationBerlin
Number of pages12
ISBN (Print)978-3-540-92184-4
Publication statusPublished - Dec 2008
Event4th International Workshop on Internet and Network Economics, WINE 2008: Internet And Network Economics (WINE 2008) - Shanghai, China, Shanghai, China
Duration: 17 Dec 200820 Dec 2008
Conference number: 4

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Workshop on Internet and Network Economics, WINE 2008
Abbreviated titleWINE 2008
Other17-20 Dec, 2008


  • EWI-13417
  • METIS-254887
  • IR-62456

Cite this