Black-box randomized reductions in algorithmic mechanism design

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 775-784

  Dughmi, Shaddin ^a   Roughgarden, Tim ^a  

^a Stanford University   (United States)

Author keywords

Mechanism design; Smoothed analysis; Truthful approximation algorithms

Indexed keywords

MACHINE DESIGN;

ALGORITHMIC MECHANISM DESIGN; LINEAR PERTURBATIONS; MECHANISM DESIGN; MULTIPARAMETER PROBLEM; OPTIMIZATION PROBLEMS; RANDOMIZED REDUCTIONS; SMOOTHED ANALYSIS; TRUTHFUL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 78751564971     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.79     Document Type: Conference Paper

References (22)

1. N. Nisan and A. Ronen, "Algorithmic mechanism design," in STOC, 1999.
2. S. Dobzinski and S. Dughmi, "On the power of randomization in algorithmic mechanism design," in FOCS'09.
3. S. Dobzinski and N. Nisan, "Limitations of vcg-based mechanisms," in STOC'07.
4. H. Röglin and S.-H. Teng, "Smoothed analysis of multiobjective optimization," in FOCS, 2009, pp. 681-690.
5. R. Lavi, "Computationally efficient approximation mechanisms," in Algorithmic Game Theory, edited by Noam Nisan and Tim Roughgarden and Eva Tardos and Vijay Vazirani.
6. P. Briest, P. Krysta, and B. Vöcking, "Approximation techniques for utilitarian mechanism design." in STOC, 2005.
7. M. Babaioff, R. Lavi, and E. Pavlov, "Single-value combinatorial auctions and algorithmic implementation in undominated strategies," J. ACM, vol. 56, no. 1, 2009.
8. J. D. Hartline and B. Lucier, "Bayesian algorithmic mechanism design," in STOC, 2010.
9. R. Lavi and C. Swamy, "Truthful and near-optimal mechanism design via linear programming," in FOCS 2005.
10. R. Lavi, A. Mu'alem, and N. Nisan, "Towards a characterization of truthful combinatorial auctions," in FOCS'03.
11. C. Papadimitriou, M. Schapira, and Y. Singer, "On the hardness of being truthful," in FOCS, 2008.
12. D. Buchfuhrer, S. Dughmi, H. Fu, R. Kleinberg, E. Mossel, C. Papadimitriou, M. Schapira, Y. Singer, and C. Umans, "Inapproximability for vcg-based combinatorial auctions," in SODA'10.
13. J. A. Kelner and D. A. Spielman, "A randomized polynomial-time simplex algorithm for linear programming," in STOC, 2006, pp. 51-60.
14. N. Nisan, 2007, introduction to Mechanism Design (for Computer Scientists). In "Algorithmic Game Theory", N. Nisan, T. Roughgarden, E. Tardos and V. Vazirani, editors.
15. D. A. Spielman and S.-H. Teng, "Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time," in STOC, 2001, pp. 296-305.
16. R. Beier and B. Vöcking, "Typical properties of winners and losers in discrete optimization," SIAM J. Comput., vol. 35, no. 4, pp. 855-881, 2006.
17. G. V. Gens and E. V. Levner, "Fast approximation algorithms for knapsack type problems," in Optimization Techniques, 1980, pp. 185-194.
18. D. S. Johnson and K. A. Niemi, "On knapsacks, partitions, and a new dynamic programming technique for trees," Mathematics of Operations Research, vol. 8, no. 1, pp. 1-14, 1983.
19. S. Sahni, "General techniques for combinatorial approximation," Operations Research, vol. 25, no. 6, pp. 920-936, 1977.
20. G. V. Gens and E. V. Levner, "Approximate algorithms for certain universal problems in scheduling theory," in Soviet Journal of Computers and System System Sciences, 1978.
21. R. Hassin, "Approximation schemes for the restricted shortest path problem," Math. Oper. Res., vol. 17, no. 1, pp. 36-42, 1992.
22. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt, "Bicriteria network design problems,," Journal of Algorithms, vol. 28, no. 1, pp. 142-171, 1998.