Skip to main navigation Skip to search Skip to main content

Mathematical Programming Approach to Multidimensional Mechanism Design for Single Machine Scheduling

Research output: Book/ReportReportProfessional

57 Downloads (Pure)

Abstract

We consider an optimal mechanism design problem for single machine scheduling that has been proposed by Heydenreich et al. in 2008. There, an example was presented to show that the 2-dimensional mechanism design problem does not satisfy a condition called IIA - independence of irrelevant alternatives. That example was flawed. In the flavour of recent work on automated mechanism design, we formulate the optimal mechanism design problem for this scheduling application as Mixed Integer Linear Programming problem (MIP). By generating problem instances systematically at random, we found minimal examples for the facts that (i) the optimal mechanism does in general not satisfy the IIA condition, and (ii) Bayes-Nash incentive compatibility and Dominant Strategy incentive compatibility are not equivalent.
Original languageEnglish
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages3
Publication statusPublished - Jul 2011

Publication series

NameCTIT Technical Report Series
PublisherUniversity of Twente, Centre for Telematics and Information Technology (CTIT)
No.TR-CTIT-11-15
ISSN (Print)1381-3625

Keywords

  • DMMP-DeCOM: Design and Complexity of Optimal Mechanisms
  • Mechanism design
  • Mathematical programming
  • Machine scheduling

Fingerprint

Dive into the research topics of 'Mathematical Programming Approach to Multidimensional Mechanism Design for Single Machine Scheduling'. Together they form a unique fingerprint.

Cite this