Mu'alem, Ahuva; Nisan, Noam - In: Games and Economic Behavior 64 (2008) 2, pp. 612-631
When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCG-like payment rules will not ensure truthfulness). We...