On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer

Xi Chen, George Matikas, Dimitris Paparas +1

We show that the Revenue-Optimal Deterministic Mechanism Design problem for a single additive buyer is #P-hard, even when the distributions have support size 2 for each item and, m…