Handling Advertisements of Unknown Quality in Search Advertising

NIPS 2006: Proceedings of the 19th International Conference on Neural Information Processing Systems

Volumn , Issue , 2006, Pages 1065-1072

  Pandey, Sandeep ^a   Olston, Christopher ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; MARKETING;

ADVERTIZING; ADVERTIZING MARKETS; BUDGET CONSTRAINT; EXPLOITATION MODELLING; EXPLORATION AND EXPLOITATION; EXPLORATION MODEL; MULTIARMED BANDIT PROBLEMS (MABP); PAY PER CLICKS; PERFORMANCE; THEORETICAL BOUNDS;

SEARCH ENGINES;

EID: 38449114136     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. N. Abe and A. Nakamura. Learning to Optimally Schedule Internet Banner Advertisements. In ICML, 1999.
2. R. Agrawal. Sample Mean Based Index Policies with O(log n) Regret for the Multi-Armed Bandit Problem. Advances in Applied Probability, 27:1054-1078, 1995.
3. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time Analysis of the Multi-Armed Bandit Problem. Machine Learning, 47:235-256, 2002.
4. D. A. Berry and B. Fristedt. Bandit Problems: Sequential Allocation of Experiments. Chapman and Hall, London, 1985.
5. N. Immorlica, K. Jain, M. Mahdian, and K. Talwar. Click Fraud Resistant Methods for Learning Click-Through Rates. In WINE, 2005.
6. T. Lai and H. Robbins. Asymptotically Efficient Adaptive Allocation Rules. Advances in Applied Mathematics, 6:4-22, 1985.
7. O. Madani and D. Decoste. Contextual Recommender Problems. In Proceedings of the 1st International Workshop on Utility-based Data Mining, 2005.
8. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. AdWords and Generalized On-line Matching. In FOCS, 2005.
9. ∼spandey/publications/ctrEstimation.pdf.
10. P. Rusmevichientong and D. Williamson. An Adaptive Algorithm for Selecting Profitable Keywords for Search-Based Advertising Services. In EC, 2006.