Name
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 novel use of smoothed analysis, by employing small perturbations as a tool in algorithmic mechanism design. We develop a “duality'' between linear perturbations of the objective function of an optimization problem and of its feasible set, and use the “primal'' and “dual'' viewpoints to prove the running time bound and the truthfulness guarantee, respectively, for our mechanism. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/FOCS.2010.79 | SIAM J. Comput. |
Keywords | DocType | Volume |
smoothed analysis,algorithmic mechanism design | Journal | 43 |
Issue | ISSN | Citations |
1 | 0272-5428 | 24 |
PageRank | References | Authors |
1.25 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shaddin Dughmi | 1 | 417 | 31.14 |
| Tim Roughgarden | 2 | 4177 | 353.32 |