Approximation Techniques for Utilitarian Mechanism Design
- 1 January 2011
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 40 (6), 1587-1622
- https://doi.org/10.1137/090772988
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due dateTheoretical Computer Science, 2006
- Approximation algorithms for minimizing the total weighted tardiness on a single machineTheoretical Computer Science, 2006
- A Polynomial Time Approximation Scheme for the Multiple Knapsack ProblemSIAM Journal on Computing, 2005
- Truth revelation in approximately efficient combinatorial auctionsJournal of the ACM, 2002
- Bicriteria Network Design ProblemsJournal of Algorithms, 1998
- Approximation Schemes for the Restricted Shortest Path ProblemMathematics of Operations Research, 1992
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analysesEuropean Journal of Operational Research, 1984
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976