Chawla S., Hartline J.D., Rajan U., Ravi R. (2006) Bayesian Optimal No-Deficit Mechanism Design. In: Spirakis P., Mavronicolas M., Kontogiannis S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg
One of the most fundamental problems in mechanism design is that of designing the auction that gives the optimal profit to the auctioneer. For the case that the probability distributions on the valuations of the bidders are known and independent, Myerson  reduces the problem to that of maximizing the common welfare by considering the virtual valuations in place of the bidders’ actual valuations. The Myerson auction maximizes the seller’s profit over the class of all mechanisms that are truthful and individually rational for all the bidders; however, the mechanism does not satisfy ex post individual rationality for the seller. In other words, there are examples in which for certain sets of bidder valuations, the mechanism incurs a loss.
We consider the problem of merging the worst case no-deficit (or ex post seller individual rationality) condition with this average case Bayesian expected profit maximization problem. When restricting our attention to ex post incentive compatible mechanisms for this problem, we find that the Myerson mechanism is the optimal no-deficit mechanism for supermodular costs, that Myerson merged with a simple thresholding mechanism is optimal for all-or-nothing costs, and that neither mechanism is optimal for general submodular costs. Addressing the computational side of the problem, we note that for supermodular costs the Myerson mechanism is NP-hard to compute. Furthermore, we show that for all-or-nothing costs the optimal thresholding mechanism is NP-hard to compute. Finally, we consider relaxing the ex post incentive compatibility constraint and show that there is a Bayesian incentive compatible mechanism that achieves the same expected profit as Myerson, but never incurs a loss.