A combinatorial allocation mechanism with penalties for banner advertising

Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08

Volumn , Issue , 2008, Pages 169-178

  Feige, Uriel ^a   Immorlica, Nicole ^b   Nazerzadeh, Hamid ^c   Mirrokni, Vahab S ^d  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b CWI   (Netherlands)

^c STANFORD UNIVERSITY   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

Combinatorial auctions; Internet advertising; Structural approximation; Supply guarantee

Indexed keywords

ADVERTISING CAMPAIGNS; ALLOCATION MECHANISMS; APPROXIMATION RESULTS; AUTOMATED SYSTEMS; BRAND RECOGNITIONS; COMBINATORIAL AUCTIONS; GREEDY ALGORITHMS; GREEDY HEURISTICS; INTERNET ADVERTISING; NEGOTIATION SYSTEMS; OPTIMUM ALGORITHMS; OPTIMUM SOLUTIONS; PERFORMANCE GUARANTEES; STRUCTURAL APPROXIMATION; SUBOPTIMAL ALLOCATIONS; SUPPLY GUARANTEE; TOTAL VALUES; TRANSACTION COSTS; WEB PAGES;

ADAPTIVE ALGORITHMS; FAILURE ANALYSIS; HEURISTIC METHODS; INTERNET; POLYNOMIAL APPROXIMATION; WORLD WIDE WEB;

APPROXIMATION ALGORITHMS;

EID: 57449112106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1367497.1367521     Document Type: Conference Paper

References (25)

1. G. Aggarwal and J. D. Hartline, Knapsack Auctions, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
2. G. Ausiello, A. D'Atri, and M. Protasi. Structure Preserving Reductions Among Convex Optimization Problems. Journal of Computer and System Sciences, 21, 136-153, 1980.
3. S. Arora, S. Rao, and U. Vazirani. Expander Flows, Geometric Embeddings, and Graph Partitionings. Proceedings of 36th Annual Symposium on the Theory of Computing (STOC), 222-231, 2004.
4. D. Bertsimas and J. Tsitsiklis. Introduction to Linear Optimization. IIE Transactions, 1998.
5. Y. Bartal, M. Charikar, and D. Raz, Approximating Min-Sum k-Clustering in Metric Spaces, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), 2001.
6. Niv Buchbinder, Kama Jain, and Sem Naor. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. Proceedings of the 15th Annual European Symposium on Algorithms (ESA), 2007.
7. P. Cramton, Y. Shoham, and R. Steinberg.f Combinatorial Auctions. MIT Press, Cambridge, MA, 2005.
8. S. Dobzinski, M. Schapira, and N. Nisan Truthful Randomized Mechanisms for Combinatorial Auctions. Proceedings of the 38rd Annual ACM Symposium on Theory of Computing (STOC), 2006.
9. U. Feige. On Maximizing Welfare When Utility Functions Are Subadditive. Proceedings of the 38rd Annual ACM Symposium, on Theory of Computing (STOC), 2006.
10. U. Feige, N. Immorlica, V. Mirrokni, and H. Nazerzadeh. Structural Approximations - a framework for analyzing and designing heuristics. manuscrip.
11. U. Feige. A Threshold of hi n for Approximating Set Cover. Journal of ACM, 45(4):634-652, 1998
12. U. Feige, V. Mirrokni, and J. Vondrak. Maximizing Non-Monotone Submodular Functions. Proceedings of 4.8th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007.
13. L. Fleischer, M. Goemans, V. Mirrokni, and M. Sviridenko. Tight Approximation Algorithms for Maximum General Assignment Problems. Symposium of Discrete Algorithms (SODA), 2006.
14. U. Feige, L. Lovász and P. Tetali, Approximating Min Sum Set Cover, Algorithmica 40(4): 219-234, 2004.
15. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co New York, 1979.
16. B. Lehmann, D. Lehmann, and N. Nisan. Combinatorial Auctions with Decreasing Marginal Utilities. Proceedings 3rd ACM Conference on Electronic Commerce (EC), 2001.
17. D. J. Lehmann, L. O'Callaghan, and Y. Shoham. Truth revelation in approximately efficient combinatorial auctions. J. ACM, 49(5), 577-602, 2002.
18. F. T. Leighton and S. Rao. An Approximate Max-Flow Min-Cut Theorem For Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. Proceedings of 29th Annual Symposium on Foundations of Computer Science, pages 422-431, 1988.
19. M. Mahdian, H. Nazerzadeh, and A. Saberi Allocating Online Advertisement Space with Unreliable Estimates Proceedings 8th ACM Conference on Electronic Commerce (EC), 2007.
20. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Ad Words and Generalized Online Matching. Journal of the ACM, Volume 54 , Issue 5, 2007.
21. Price water house Coopers LLP. IAB Internet Advertising Revenue Report. http://www.iab.net/resources/adrevenue/pdf/IAB-PwC-2006-Final.pdf
22. T. Roughgarden and É. Tardos. How Bad is Selfish Routing?. Proceedings of IEEE Symposium on Foundations of Computer Science, 93-102, 2000.
23. T. Sandholm. Algorithm for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence, 135:1-54, 2002.
24. A. Schrijver. Combinatorial Optimization. Springer, 2003.
25. D. B. West. Introduction to Graph Theory. Prentice Hall, 2001.