The Complexity of Optimal Mechanism Design

@inproceedings{Daskalakis2014TheCO,
  title={The Complexity of Optimal Mechanism Design},
  author={Constantinos Daskalakis and Alan Deckelbaum and Christos Tzamos},
  booktitle={SODA},
  year={2014}
}
Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly understood. We answer this question by showing that a revenue-optimal auction in multi-item settings cannot be found and implemented computationally efficiently, unless ZPP = P. This is true even for a… CONTINUE READING