Black-Box Randomized Reductions in Algorithmic Mechanism Design

SIAM J. Comput., pp. 312-336, 2014.

Cited by: 58|Bibtex|Views16|Links
EI WOS
Keywords:
smoothed analysisalgorithmic mechanism design

Abstract:

We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multi-parameter problems. Specifically, we prove that every packing problem that admits an FPTAS also admits a truthful-in-expectation randomized mechanism that is an FPTAS. Our reduction makes nove...More

Code:

Data:

Your rating :
0

 

Tags
Comments