Multi-parameter Mechanisms with Implicit Payment Computation

ACM Conference on Electronic Commerce (ACM-EC 2013) |

Published by ACM

In this paper we show that payment computation essentially does not present any obstacle in designing truthful mechanisms, even for multi-parameter domains, and even when we can only call the allocation rule once. We present a general reduction that takes any allocation rule which satisfies “cyclic monotonicity” (a known necessary and sufficient condition for truthfulness) and converts it to a truthful mechanism using a single call to the allocation rule, with arbitrarily small loss to the expected social welfare. A prominent example for a multi-parameter setting in which an allocation rule can only be called once arises in sponsored search auctions. These are multi-parameter domains when each advertiser has multiple possible ads he may display, each with a different value per click. Moreover, the mechanism typically does not have complete knowledge of the click-realization or the click-through rates (CTRs); it can only call the allocation rule a single time and observe the click information for ads that were presented. % are not known. On the negative side, we show that an allocation that is truthful for any realization essentially cannot depend on the bids, and hence cannot do better than random selection for one agent. We then consider a relaxed requirement of truthfulness, only in expectation over the CTRs. Even for that relaxed version, making any progress is challenging as standard techniques for construction of truthful mechanisms (as using VCG or an MIDR allocation rule) cannot be used in this setting. We design an allocation rule with non-trivial performance and directly prove it is cyclic-monotone, and thus it can be used to create a truthful mechanism using our general reduction.