Improvements to the linear programming based scheduling of web advertisements

Electronic Commerce Research

Volumn 5, Issue 1, 2005, Pages 75-98

  Nakamura, Atsuyoshi ^a   Abe, Naoki ^b  

^a HOKKAIDO UNIVERSITY   (Japan)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Banner advertisement scheduling; Exploration exploitation trade off; Inventory management; Linear programming

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; INVENTORY CONTROL; LINEAR PROGRAMMING;

BANNER ADVERTISEMENT SCHEDULING; CLICKTHROUGH RATES (CTR); EXPLORATION-EXPLOITATION TRADE-OFF; EXPLORATION/EXPLOITATION; INVENTORY MANAGEMENT; LINEAR PROGRAMMING FORMULATION; LINEAR-PROGRAMMING; OPTIMISATIONS; TECHNICAL CHALLENGES; TRADE OFF;

SCHEDULING;

EID: 27444435566     PISSN: 13895753     EISSN: 15729362     Source Type: Journal    
DOI: 10.1023/B:ELEC.0000045974.88926.88     Document Type: Conference Paper

References (18)

1. Abe, N. and A. Nakamura. (1999). "Learning to Optimally Schedule Internet Banner Advertisements." In Proc. of the 16lh International Conference on Machine Learning, pp. 12-21.
2. Bradley, G., G. Brown, and G. Graves. (1977), "Design and Implementation of a Large Scale Primal Transshipment Algorithm." Management Science 24, 1-34.
3. Berry, D.A. and B. Fristedt. (1985). Bandit Problems. Chapman & Hall.
4. Chickering. D. and D. Heckerman. (2000). "Targeted Advertising with Inventory Management." In Proc. of ACM Special Interest Group on E-Commerce (EC00), pp. 145-149.
5. Dantzig, G. (1963). Linear Programming and Extensions. Princeton University Press.
6. DoubleClick Inc. (2003). DoubleClick 2002 Full-Year Ad Serving Trends.
7. Feller, W. (1968). An Introduction to Probability Theory and its Applications. Vol. 1. Wiley. 3rd edition.
8. Gittins. J.C. (1988). Multi-Armed Bandit Allocation Indices. Chichester: Wiley.
9. Lanheinrich, M., A. Nakamura. N. Abe, T. Kamba, and Y. Koseki. (1999). "Unintrusive Customization Techniques for Web Advertising." Computer Networks 31, 1259-1272.
10. Li, H. and N. Abe. (1998). "Word Clustering and Disambiguation Based on Co-Occurrence Data." In Proceedings of COLING-ACL, pp. 749-755.
11. Nakamura. A. (2002). "Improvements in Practical Aspects of Optimally Scheduling Web Advertising." In Proc. of the 11th International World Wide Web Conference, pp. 536-541.
12. Nakamura. A. and N. Abe. (1998). "Collaborative Filtering Using Weighted Majority Prediction Algorithms." In Proc. of the 15th International Conference on Machine Learning, pp. 395-403.
13. Pazzani, M. (1999). "A Framework for Collaborative, Content-Based and Demographic Filtering." Artificial Intelligence Revietv 13(5-6), 393-408.
14. Quinlan. R. (1993). C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann.
15. Rissanen. J. (1978). "Modeling by Shortest Data Description." Automatica 14, 37-38.
16. Sakamoto, Y. Y Ishiguro. and M. Kitagawa. (1986). Akaike Information Criterion Statistics. Dordrecht: Reidel.
17. Tomlin, J. (2000). "An Entropy Approach to Unintrusive Targeted Advertising on the Web." Computer Networks 33, 767-774.
18. Ye, Y. (1997). Interior Point Algorithms: Theory and Analysis. Wiley-lnterscience Series in Discrete Mathematics and Optimization. New York: Wiley.