Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Impossibility of Black-Box Transformations in Mechanism Design   We consider the problem of converting an arbitrary approximation algorithm
for a single-parameter optimization problem into a computationally efficient
truthful mechanism. We ask for reductions that are black-box, meaning that they
require only oracle access to the given algorithm and in particular do not
require explicit knowledge of the problem constraints. Such a reduction is
known to be possible, for example, for the social welfare objective when the
goal is to achieve Bayesian truthfulness and preserve social welfare in
expectation. We show that a black-box reduction for the social welfare
objective is not possible if the resulting mechanism is required to be truthful
in expectation and to preserve the worst-case approximation ratio of the
algorithm to within a subpolynomial factor. Further, we prove that for other
objectives such as makespan, no black-box reduction is possible even if we only
require Bayesian truthfulness and an average-case performance guarantee.

15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
4
The categories of this paper are: cond-mat
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
13
The categories of this paper are: quant-ph
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
10
The categories of this paper are: q-bio