Black-Box Randomized Reductions in Algorithmic Mechanism Design
- 1 January 2014
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 43 (1), 312-336
- https://doi.org/10.1137/110843654
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Truthful and Near-Optimal Mechanism Design via Linear ProgrammingJournal of the ACM, 2011
- Limitations of VCG-based mechanismsCombinatorica, 2011
- Approximation Techniques for Utilitarian Mechanism DesignSIAM Journal on Computing, 2011
- Single-value combinatorial auctions and algorithmic implementation in undominated strategiesJournal of the ACM, 2009
- Typical Properties of Winners and Losers [0.2ex] in Discrete OptimizationSIAM Journal on Computing, 2006
- Algorithmic Mechanism DesignGames and Economic Behavior, 2001
- Bicriteria Network Design ProblemsJournal of Algorithms, 1998
- Approximation Schemes for the Restricted Shortest Path ProblemMathematics of Operations Research, 1992
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for TreesMathematics of Operations Research, 1983
- General Techniques for Combinatorial ApproximationOperations Research, 1977