From convex optimization to randomized mechanisms: Toward optimal combinatorial auctions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 149-158

  Dughmi, Shaddin ^a   Roughgarden, Tim ^a   Yan, Qiqi ^a  

^a Stanford University   (United States)

Author keywords

algorithmic mechanism design; combinatorial auctions

Indexed keywords

COMBINATORIAL MATHEMATICS; COMMERCE; COMPUTATION THEORY; CONVEX OPTIMIZATION; MACHINE DESIGN; POLYNOMIAL APPROXIMATION;

ALGORITHMIC MECHANISM DESIGN; COMBINATORIAL AUCTION; CONCAVE OBJECTIVE FUNCTIONS; CONSTANT FACTOR APPROXIMATION; FRACTIONAL SOLUTIONS; POLYNOMIAL-TIME MECHANISM; RANDOMIZED MECHANISM; WELFARE MAXIMIZATIONS;

APPROXIMATION ALGORITHMS;

EID: 79959753563     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993657     Document Type: Conference Paper

References (24)

1. X. Bei and Z. Huang. Towards optimal bayesian algorithmic mechanism design. In Proc. 22nd ACM Symp. on Discrete Algorithms (SODA), 2011.
2. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, 2001.
3. L. Blumrosen and N. Nisan. Combinatorial auctions (a survey). In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory. Cambridge University Press, 2007.
4. P. Cramton, Y. Shoham, and R. S. (Editors). Combinatorial Auctions. MIT Press., 2006.
5. S. Dobzinski. Two randomized mechanisms for combinatorial auctions. In Proc. 10th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2007.
6. S. Dobzinski and S. Dughmi. On the power of randomization in algorithmic mechanism design. In Proc. 50th IEEE Symp. on Foundations of Computer Science (FOCS), 2009.
7. S. Dobzinski, H. Fu, and R. Kleinberg. Truthfulness via proxies. CoRR, abs/1011.3232, 2010.
8. S. Dobzinski and M. Schapira. An improved approximation algorithm for combinatorial auctions with submodular bidders. In Proc. 17th ACM Symp. on Discrete Algorithms (SODA), 2006.
9. S. Dughmi and T. Roughgarden. Black-box randomized reductions in algorithmic mechanism design. In Proc. 51st IEEE Symp. on Foundations of Computer Science (FOCS), 2010.
10. S. Dughmi, T. Roughgarden, and M. Sundararajan. Revenue submodularity. In Proc. 11th ACM Conf. on Electronic Commerce (EC), 2009.
11. U. Feige. On maximizing welfare where the utility functions are subadditive. In Proc. 37th ACM Symp. on Theory of Computing (STOC), 2006.
12. J. Hartline, R. Kleinberg, and A. Malekian. Multi-parameter bayesian algorithmic mechanism design. In Proc. 22nd ACM Symp. on Discrete Algorithms (SODA), 2011.
13. J. D. Hartline and B. Lucier. Bayesian algorithmic mechanism design. In Proc. 41st ACM Symp. on Theory of Computing (STOC), 2010.
14. S. Khot, R. J. Lipton, E. Markakis, and A. Mehta. Inapproximability results for combinatorial auctions with submodular utility functions. Algorithmica, 52(1):3-18, 2008.
15. R. Lavi, A. Mu'alem, and N. Nisan. Towards a characterization of truthful combinatorial auctions. In Proc. 44th IEEE Symp. on Foundations of Computer Science (FOCS), 2003.
16. R. Lavi and C. Swamy. Truthful and near-optimal mechanism design via linear programming. In Proc. 46th IEEE Symp. on Foundations of Computer Science (FOCS), 2005.
17. B. Lehmann, D. Lehmann, and N. Nisan. Combinatorial auctions with decreasing marginal utilities. In Proc. 3rd ACM Conf. on Electronic Commerce (EC), 2001.
18. D. Lehmann, L. I. O'Callaghan, and Y. Shoham. Truth revelation in approximately efficient combinatorial auctions. In JACM 49(5), pages 577-602, Sept. 2002.
19. V. Mirrokni, M. Schapira, and J. Vondrák. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In Proc. 10th ACM Conf. on Electronic Commerce (EC), 2008.
20. N. Nisan. Introduction to mechanism design (for computer scientists). In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory. Cambridge University Press, 2007.
21. J. G. Oxley. Matroid Theory. Oxford University Press, 1992.
22. C. Papadimitriou, M. Schapira, and Y. Singer. On the hardness of being truthful. In Proc. 49th IEEE Symp. on Foundations of Computer Science (FOCS), 2008.
23. A. Schrijver. Combinatorial Optimization. Springer, 2003.
24. J. Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In Proc. 39th ACM Symp. on Theory of Computing (STOC), 2008.