On the approximability of budget feasible mechanisms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 685-699

  Chen, Ning ^a   Gravin, Nick ^a,b   Lu, Pinyan ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; MACHINE DESIGN;

ALGORITHMIC MECHANISM DESIGN; APPROXIMATION RATIOS; BUDGET CONSTRAINT; COMPLEXITY ASSUMPTIONS; DETERMINISTIC MECHANISM; KNAPSACK PROBLEMS; RANDOMIZED MECHANISM; SUBMODULAR FUNCTIONS;

BUDGET CONTROL;

EID: 79955714045     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.54     Document Type: Conference Paper

References (15)

1. A. Archer, É. Tardos, Frugal Path Mechanisms, SODA 2002, 991-999.
2. S. Bhattacharya, G. Goel, S. Gollapudi K. Munagala, Budget Constrained Auctions with Heterogeneous Items, STOC 2010.
3. S. Chawla, J. Hartline, D. Malec, B. Sivan, Sequential Posted Pricing and Multi-Parameter Mechanism Design, STOC 2010.
4. N. Chen, E. Elkind, N. Gravin, F. Petrov, Frugal Mechanism Design via Spectral Techniques, FOCS 2010.
5. G. Christodoulou, E. Koutsoupias, A. Vidali, A lower Bound for Scheduling Mechanisms, SODA 2007, 1163- 1170.
6. S. Dobzinski, A Note on the Power of lYuthful Approximation Mechanisms, arXiv:0907.5219v2.
7. S. Dobzinski, R. Lavi, N. Nisan, Multi-Unit Auctions with Budget Limits, FOCS 2008, 260-269.
8. U. Feige, V. Mirrokni, J. Vondrak, Maximizing NonMonotone Submodular Functions, FOCS 2007, 461- 471.
9. S. Khuller, A. Moss, J. S. Naor, The Budgeted Maximum Coverage Problem, Information Processing Letter, V.70(l), 39-45, 1999.
10. A. R. Karlin, D. Kempe, T. Tamir, Beyond VCG: Frugality of lYuthful Mechanisms, FOCS 2005, 615- 626.
11. D. Kempe, M. Salek, C. Moore, Frugal and'lYuthful Auctions for Vertex Covers, Flows, and Cuts, FOCS 2010.
12. E. Koutsoupias, A. Vidali, A Lower Bound of 1 + ø for lYuthful Scheduling Mechanisms, MFCS 2007, 454-464.
13. A. Krause, C. Guestrin, A Note on the Budgeted Maximization of Submodular Functions, CMU-CALD- 05-103.
14. J. Lee, V. Mirrokni, V. Nagarajan, M. Sviridenko, NonMonotone Submodular Maximization under Matroid and Knapsack Constraints, STOC 2009, 323-332.
15. B. Lehmann, D. Lehmann, N. Nisan, Combinatorial Auctions with Decreasing Marginal Utilities, EC 2001, 18-28.